<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
<head>
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
<meta http-equiv="X-UA-Compatible" content="IE=11"/>
<meta name="generator" content="Doxygen 1.14.0"/>
<meta name="viewport" content="width=device-width, initial-scale=1"/>
<title>my_binary_tree: my_tree.h Source File</title>
<link href="tabs.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="jquery.js"></script>
<script type="text/javascript" src="dynsections.js"></script>
<script type="text/javascript" src="clipboard.js"></script>
<link href="navtree.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="navtreedata.js"></script>
<script type="text/javascript" src="navtree.js"></script>
<script type="text/javascript" src="cookie.js"></script>
<link href="search/search.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="search/searchdata.js"></script>
<script type="text/javascript" src="search/search.js"></script>
<link href="doxygen.css" rel="stylesheet" type="text/css" />
</head>
<body>
<div id="top"><!-- do not remove this div, it is closed by doxygen! -->
<div id="titlearea">
<table cellspacing="0" cellpadding="0">
 <tbody>
 <tr id="projectrow">
  <td id="projectalign">
   <div id="projectname">my_binary_tree<span id="projectnumber">&#160;0.1</span>
   </div>
  </td>
 </tr>
 </tbody>
</table>
</div>
<!-- end header part -->
<!-- Generated by Doxygen 1.14.0 -->
<script type="text/javascript">
var searchBox = new SearchBox("searchBox", "search/",'.html');
</script>
<script type="text/javascript">
$(function() { codefold.init(); });
</script>
<script type="text/javascript" src="menudata.js"></script>
<script type="text/javascript" src="menu.js"></script>
<script type="text/javascript">
$(function() {
  initMenu('',true,false,'search.php','Search',true);
  $(function() { init_search(); });
});
</script>
<div id="main-nav"></div>
</div><!-- top -->
<div id="side-nav" class="ui-resizable side-nav-resizable">
  <div id="nav-tree">
    <div id="nav-tree-contents">
      <div id="nav-sync" class="sync"></div>
    </div>
  </div>
  <div id="splitbar" style="-moz-user-select:none;" 
       class="ui-resizable-handle">
  </div>
</div>
<script type="text/javascript">
$(function(){initNavTree('my__tree_8h_source.html','',''); });
</script>
<div id="container">
<div id="doc-content">
<!-- window showing the filter options -->
<div id="MSearchSelectWindow"
     onmouseover="return searchBox.OnSearchSelectShow()"
     onmouseout="return searchBox.OnSearchSelectHide()"
     onkeydown="return searchBox.OnSearchSelectKey(event)">
</div>

<!-- iframe showing the search results (closed by default) -->
<div id="MSearchResultsWindow">
<div id="MSearchResults">
<div class="SRPage">
<div id="SRIndex">
<div id="SRResults"></div>
<div class="SRStatus" id="Loading">Loading...</div>
<div class="SRStatus" id="Searching">Searching...</div>
<div class="SRStatus" id="NoMatches">No Matches</div>
</div>
</div>
</div>
</div>

<div class="header">
  <div class="headertitle"><div class="title">my_tree.h</div></div>
</div><!--header-->
<div class="contents">
<div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span><span class="preprocessor">#include&lt;iostream&gt;</span></div>
<div class="line"><a id="l00002" name="l00002"></a><span class="lineno">    2</span><span class="preprocessor">#include&lt;vector&gt;</span></div>
<div class="line"><a id="l00003" name="l00003"></a><span class="lineno">    3</span><span class="preprocessor">#include&lt;stack&gt;</span></div>
<div class="line"><a id="l00004" name="l00004"></a><span class="lineno">    4</span><span class="preprocessor">#include&lt;queue&gt;</span></div>
<div class="line"><a id="l00005" name="l00005"></a><span class="lineno">    5</span><span class="preprocessor">#include&lt;algorithm&gt;</span></div>
<div class="line"><a id="l00006" name="l00006"></a><span class="lineno">    6</span><span class="preprocessor">#include&lt;string&gt;</span></div>
<div class="line"><a id="l00007" name="l00007"></a><span class="lineno">    7</span><span class="preprocessor">#include&lt;functional&gt;</span></div>
<div class="line"><a id="l00008" name="l00008"></a><span class="lineno">    8</span><span class="preprocessor">#include&lt;cassert&gt;</span></div>
<div class="line"><a id="l00009" name="l00009"></a><span class="lineno">    9</span><span class="preprocessor">#include&lt;cstdlib&gt;</span></div>
<div class="line"><a id="l00010" name="l00010"></a><span class="lineno">   10</span><span class="preprocessor">#include&lt;cmath&gt;</span></div>
<div class="line"><a id="l00011" name="l00011"></a><span class="lineno">   11</span><span class="keyword">using namespace </span>std;</div>
<div class="line"><a id="l00012" name="l00012"></a><span class="lineno">   12</span></div>
<div class="line"><a id="l00016" name="l00016"></a><span class="lineno">   16</span><span class="keyword">const</span> <span class="keywordtype">int</span> space = -999;</div>
<div class="line"><a id="l00017" name="l00017"></a><span class="lineno">   17</span> </div>
<div class="line"><a id="l00018" name="l00018"></a><span class="lineno">   18</span><span class="comment">//---------------------------------------------工具函数----------------------------------------</span></div>
<div class="line"><a id="l00019" name="l00019"></a><span class="lineno">   19</span></div>
<div class="line"><a id="l00027" name="l00027"></a><span class="lineno">   27</span><span class="keywordtype">int</span> clac_space(<span class="keywordtype">int</span> h, <span class="keywordtype">int</span> height) {</div>
<div class="line"><a id="l00028" name="l00028"></a><span class="lineno">   28</span>    <span class="keywordtype">int</span> width = 3 * pow(2, height - 1);  <span class="comment">// 树的总宽度（像素单位）</span></div>
<div class="line"><a id="l00029" name="l00029"></a><span class="lineno">   29</span>    <span class="keywordtype">int</span> now_point = pow(2, h - 1);       <span class="comment">// 当前行的节点总数</span></div>
<div class="line"><a id="l00030" name="l00030"></a><span class="lineno">   30</span>    <span class="keywordtype">float</span> ans_num = (float)width / now_point;  <span class="comment">// 每个节点分配的宽度</span></div>
<div class="line"><a id="l00031" name="l00031"></a><span class="lineno">   31</span>    <span class="keywordtype">int</span> ans_space = (ans_num - 1) / 2;   <span class="comment">// 节点前的空格数（居中对齐）</span></div>
<div class="line"><a id="l00032" name="l00032"></a><span class="lineno">   32</span>    <span class="keywordflow">return</span> ans_space;</div>
<div class="line"><a id="l00033" name="l00033"></a><span class="lineno">   33</span>}</div>
<div class="line"><a id="l00034" name="l00034"></a><span class="lineno">   34</span></div>
<div class="line"><a id="l00040" name="l00040"></a><span class="lineno">   40</span><span class="keywordtype">void</span> print_fulltov(vector&lt;int&gt;&amp; v, <span class="keywordtype">int</span> x) {</div>
<div class="line"><a id="l00041" name="l00041"></a><span class="lineno">   41</span>    v.push_back(x);</div>
<div class="line"><a id="l00042" name="l00042"></a><span class="lineno">   42</span>}</div>
<div class="line"><a id="l00043" name="l00043"></a><span class="lineno">   43</span> </div>
<div class="line"><a id="l00044" name="l00044"></a><span class="lineno">   44</span><span class="keyword">static</span> <span class="keywordtype">int</span> function_counter;  <span class="comment">// 用于遍历向量时的索引计数（全局辅助变量）</span></div>
<div class="line"><a id="l00051" name="l00051"></a><span class="lineno">   51</span><span class="keywordtype">void</span> print_tov(vector&lt;int&gt;&amp; v, <span class="keywordtype">int</span> x) {</div>
<div class="line"><a id="l00052" name="l00052"></a><span class="lineno">   52</span>    <span class="keywordflow">if</span> (function_counter &lt; v.size()) {</div>
<div class="line"><a id="l00053" name="l00053"></a><span class="lineno">   53</span>        v[function_counter] = x;</div>
<div class="line"><a id="l00054" name="l00054"></a><span class="lineno">   54</span>    }</div>
<div class="line"><a id="l00055" name="l00055"></a><span class="lineno">   55</span>}</div>
<div class="line"><a id="l00056" name="l00056"></a><span class="lineno">   56</span> </div>
<div class="line"><a id="l00057" name="l00057"></a><span class="lineno">   57</span></div>
<div class="line"><a id="l00062" name="l00062"></a><span class="lineno">   62</span><span class="keywordtype">void</span> empty_function() {</div>
<div class="line"><a id="l00063" name="l00063"></a><span class="lineno">   63</span>    <span class="keywordflow">return</span>;</div>
<div class="line"><a id="l00064" name="l00064"></a><span class="lineno">   64</span>}</div>
<div class="line"><a id="l00065" name="l00065"></a><span class="lineno">   65</span></div>
<div class="line"><a id="l00070" name="l00070"></a><span class="lineno">   70</span><span class="keywordtype">void</span> print(<span class="keywordtype">int</span> x) {</div>
<div class="line"><a id="l00071" name="l00071"></a><span class="lineno">   71</span>    cout &lt;&lt; x &lt;&lt; <span class="charliteral">&#39; &#39;</span>;</div>
<div class="line"><a id="l00072" name="l00072"></a><span class="lineno">   72</span>}</div>
<div class="line"><a id="l00073" name="l00073"></a><span class="lineno">   73</span></div>
<div class="line"><a id="l00078" name="l00078"></a><span class="lineno">   78</span><span class="keywordtype">void</span> self_increase(<span class="keywordtype">int</span>&amp; x) {</div>
<div class="line"><a id="l00079" name="l00079"></a><span class="lineno">   79</span>    x++;</div>
<div class="line"><a id="l00080" name="l00080"></a><span class="lineno">   80</span>}</div>
<div class="line"><a id="l00081" name="l00081"></a><span class="lineno">   81</span></div>
<div class="line"><a id="l00088" name="l00088"></a><span class="lineno">   88</span><span class="keywordtype">bool</span> is_2_power(<span class="keywordtype">int</span> num, <span class="keywordtype">int</span> height) {</div>
<div class="line"><a id="l00089" name="l00089"></a><span class="lineno">   89</span>    vector&lt;int&gt; v;</div>
<div class="line"><a id="l00090" name="l00090"></a><span class="lineno">   90</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 1; i &lt;= height; i++) {</div>
<div class="line"><a id="l00091" name="l00091"></a><span class="lineno">   91</span>        v.push_back(pow(2, i));</div>
<div class="line"><a id="l00092" name="l00092"></a><span class="lineno">   92</span>    }</div>
<div class="line"><a id="l00093" name="l00093"></a><span class="lineno">   93</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> v_num : v) {</div>
<div class="line"><a id="l00094" name="l00094"></a><span class="lineno">   94</span>        <span class="keywordflow">if</span> (v_num == num) {</div>
<div class="line"><a id="l00095" name="l00095"></a><span class="lineno">   95</span>            <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
<div class="line"><a id="l00096" name="l00096"></a><span class="lineno">   96</span>        }</div>
<div class="line"><a id="l00097" name="l00097"></a><span class="lineno">   97</span>    }</div>
<div class="line"><a id="l00098" name="l00098"></a><span class="lineno">   98</span>    <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
<div class="line"><a id="l00099" name="l00099"></a><span class="lineno">   99</span>}</div>
<div class="line"><a id="l00100" name="l00100"></a><span class="lineno">  100</span> </div>
<div class="line"><a id="l00101" name="l00101"></a><span class="lineno">  101</span></div>
<div class="line"><a id="l00108" name="l00108"></a><span class="lineno">  108</span><span class="keywordtype">int</span> lowbit(<span class="keywordtype">int</span> x) {</div>
<div class="line"><a id="l00109" name="l00109"></a><span class="lineno">  109</span>    <span class="keywordflow">return</span> x &amp; -x;</div>
<div class="line"><a id="l00110" name="l00110"></a><span class="lineno">  110</span>}</div>
<div class="line"><a id="l00111" name="l00111"></a><span class="lineno">  111</span> </div>
<div class="line"><a id="l00112" name="l00112"></a><span class="lineno">  112</span><span class="comment">//------------------------------------------模板声明------------------------------------</span></div>
<div class="line"><a id="l00113" name="l00113"></a><span class="lineno">  113</span> </div>
<div class="line"><a id="l00114" name="l00114"></a><span class="lineno">  114</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T&gt;</div>
<div class="line"><a id="l00115" name="l00115"></a><span class="lineno">  115</span><span class="keyword">class </span><a class="code hl_class" href="classmy__binary__tree.html">my_binary_tree</a>;</div>
<div class="line"><a id="l00116" name="l00116"></a><span class="lineno">  116</span> </div>
<div class="line"><a id="l00117" name="l00117"></a><span class="lineno">  117</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T&gt;</div>
<div class="line"><a id="l00118" name="l00118"></a><span class="lineno">  118</span><span class="keywordtype">bool</span> <a class="code hl_friend" href="classmy__binary__tree.html#a9b5581a82079878a7faac62d07bbcc12">operator==</a>(<a class="code hl_class" href="classmy__binary__tree.html">my_binary_tree&lt;T&gt;</a> lhs, <a class="code hl_class" href="classmy__binary__tree.html">my_binary_tree&lt;T&gt;</a> rhs);</div>
<div class="line"><a id="l00119" name="l00119"></a><span class="lineno">  119</span> </div>
<div class="line"><a id="l00120" name="l00120"></a><span class="lineno">  120</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T&gt;</div>
<div class="line"><a id="l00121" name="l00121"></a><span class="lineno">  121</span><span class="keywordtype">bool</span> <a class="code hl_friend" href="classmy__binary__tree.html#a57bcf0e8e11dcb2db4d3c2b72e62d913">operator!=</a>(<a class="code hl_class" href="classmy__binary__tree.html">my_binary_tree&lt;T&gt;</a> lhs, <a class="code hl_class" href="classmy__binary__tree.html">my_binary_tree&lt;T&gt;</a> rhs);</div>
<div class="line"><a id="l00122" name="l00122"></a><span class="lineno">  122</span> </div>
<div class="line"><a id="l00123" name="l00123"></a><span class="lineno">  123</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T&gt;</div>
<div class="line"><a id="l00124" name="l00124"></a><span class="lineno">  124</span>ostream&amp; <a class="code hl_friend" href="classmy__binary__tree.html#a9b9d88b02caf22fc6de3a78e3a514816">operator&lt;&lt;</a>(ostream&amp; os, <a class="code hl_class" href="classmy__binary__tree.html">my_binary_tree&lt;T&gt;</a> p);</div>
<div class="line"><a id="l00125" name="l00125"></a><span class="lineno">  125</span> </div>
<div class="line"><a id="l00126" name="l00126"></a><span class="lineno">  126</span><span class="keyword">template</span> &lt;<span class="keyword">typename</span> T&gt;</div>
<div class="line"><a id="l00127" name="l00127"></a><span class="lineno">  127</span><span class="keyword">class </span><a class="code hl_class" href="classmy__binary__search__tree.html">my_binary_search_tree</a>;</div>
<div class="line"><a id="l00128" name="l00128"></a><span class="lineno">  128</span> </div>
<div class="line"><a id="l00129" name="l00129"></a><span class="lineno">  129</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T&gt;</div>
<div class="line"><a id="l00130" name="l00130"></a><span class="lineno">  130</span><span class="keyword">class </span><a class="code hl_class" href="classmy__complete__binary__tree.html">my_complete_binary_tree</a>;</div>
<div class="line"><a id="l00131" name="l00131"></a><span class="lineno">  131</span> </div>
<div class="line"><a id="l00132" name="l00132"></a><span class="lineno">  132</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T&gt;</div>
<div class="line"><a id="l00133" name="l00133"></a><span class="lineno">  133</span><span class="keyword">class </span><a class="code hl_class" href="classmy__full__binary__tree.html">my_full_binary_tree</a>;</div>
<div class="line"><a id="l00134" name="l00134"></a><span class="lineno">  134</span> </div>
<div class="line"><a id="l00135" name="l00135"></a><span class="lineno">  135</span> </div>
<div class="line"><a id="l00136" name="l00136"></a><span class="lineno">  136</span><span class="comment">//-----------------------------------------定义主类----------------------------------------</span></div>
<div class="line"><a id="l00137" name="l00137"></a><span class="lineno">  137</span></div>
<div class="line"><a id="l00143" name="l00143"></a><span class="lineno">  143</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T&gt;</div>
<div class="foldopen" id="foldopen00144" data-start="{" data-end="};">
<div class="line"><a id="l00144" name="l00144"></a><span class="lineno"><a class="line" href="classmy__binary__tree.html">  144</a></span><span class="keyword">class </span><a class="code hl_function" href="classmy__binary__tree.html#ae19ca02504d47a17836f0b0c533f8982">my_binary_tree</a> {</div>
<div class="line"><a id="l00145" name="l00145"></a><span class="lineno">  145</span>    <span class="keyword">protected</span>:</div>
<div class="line"><a id="l00146" name="l00146"></a><span class="lineno"><a class="line" href="classmy__binary__tree.html#ae2d15edcaec6e5543a5e8c64ea0173cb">  146</a></span>        T <a class="code hl_variable" href="classmy__binary__tree.html#ae2d15edcaec6e5543a5e8c64ea0173cb">data</a>;                     </div>
<div class="line"><a id="l00147" name="l00147"></a><span class="lineno"><a class="line" href="classmy__binary__tree.html#a69a6f187348e8b6219809620e784d3cf">  147</a></span>        <a class="code hl_function" href="classmy__binary__tree.html#ae19ca02504d47a17836f0b0c533f8982">my_binary_tree&lt;T&gt;</a>* <a class="code hl_variable" href="classmy__binary__tree.html#a69a6f187348e8b6219809620e784d3cf">left</a>;       </div>
<div class="line"><a id="l00148" name="l00148"></a><span class="lineno"><a class="line" href="classmy__binary__tree.html#a8910dc810a9a95fe4dc308eeef739b6a">  148</a></span>        <a class="code hl_function" href="classmy__binary__tree.html#ae19ca02504d47a17836f0b0c533f8982">my_binary_tree&lt;T&gt;</a>* <a class="code hl_variable" href="classmy__binary__tree.html#a8910dc810a9a95fe4dc308eeef739b6a">right</a>;      </div>
<div class="line"><a id="l00149" name="l00149"></a><span class="lineno">  149</span>    </div>
<div class="line"><a id="l00150" name="l00150"></a><span class="lineno">  150</span>    <span class="keyword">public</span>:</div>
<div class="line"><a id="l00151" name="l00151"></a><span class="lineno">  151</span>        <span class="comment">//----------------------------------构造相关------------------------------------</span></div>
<div class="line"><a id="l00157" name="l00157"></a><span class="lineno"><a class="line" href="classmy__binary__tree.html#ae19ca02504d47a17836f0b0c533f8982">  157</a></span>        <a class="code hl_function" href="classmy__binary__tree.html#ae19ca02504d47a17836f0b0c533f8982">my_binary_tree</a>(T val) : <a class="code hl_variable" href="classmy__binary__tree.html#ae2d15edcaec6e5543a5e8c64ea0173cb">data</a>(val), <a class="code hl_variable" href="classmy__binary__tree.html#a69a6f187348e8b6219809620e784d3cf">left</a>(NULL), <a class="code hl_variable" href="classmy__binary__tree.html#a8910dc810a9a95fe4dc308eeef739b6a">right</a>(NULL) {}</div>
<div class="line"><a id="l00158" name="l00158"></a><span class="lineno">  158</span>    </div>
<div class="foldopen" id="foldopen00164" data-start="{" data-end="}">
<div class="line"><a id="l00164" name="l00164"></a><span class="lineno"><a class="line" href="classmy__binary__tree.html#a6faf690077dab82f4d1f72920c3834fd">  164</a></span>        <a class="code hl_function" href="classmy__binary__tree.html#a6faf690077dab82f4d1f72920c3834fd">my_binary_tree</a>(<span class="keyword">const</span> <a class="code hl_function" href="classmy__binary__tree.html#ae19ca02504d47a17836f0b0c533f8982">my_binary_tree&lt;T&gt;</a>&amp; other) : <a class="code hl_variable" href="classmy__binary__tree.html#ae2d15edcaec6e5543a5e8c64ea0173cb">data</a>(other.<a class="code hl_variable" href="classmy__binary__tree.html#ae2d15edcaec6e5543a5e8c64ea0173cb">data</a>), <a class="code hl_variable" href="classmy__binary__tree.html#a69a6f187348e8b6219809620e784d3cf">left</a>(NULL), <a class="code hl_variable" href="classmy__binary__tree.html#a8910dc810a9a95fe4dc308eeef739b6a">right</a>(NULL) {</div>
<div class="line"><a id="l00165" name="l00165"></a><span class="lineno">  165</span>            <span class="keywordflow">if</span> (other.<a class="code hl_variable" href="classmy__binary__tree.html#a69a6f187348e8b6219809620e784d3cf">left</a>) <a class="code hl_variable" href="classmy__binary__tree.html#a69a6f187348e8b6219809620e784d3cf">left</a> = <span class="keyword">new</span> <a class="code hl_function" href="classmy__binary__tree.html#ae19ca02504d47a17836f0b0c533f8982">my_binary_tree&lt;T&gt;</a>(*other.<a class="code hl_variable" href="classmy__binary__tree.html#a69a6f187348e8b6219809620e784d3cf">left</a>);</div>
<div class="line"><a id="l00166" name="l00166"></a><span class="lineno">  166</span>            if (other.<a class="code hl_variable" href="classmy__binary__tree.html#a8910dc810a9a95fe4dc308eeef739b6a">right</a>) <a class="code hl_variable" href="classmy__binary__tree.html#a8910dc810a9a95fe4dc308eeef739b6a">right</a> = <span class="keyword">new</span> <a class="code hl_function" href="classmy__binary__tree.html#ae19ca02504d47a17836f0b0c533f8982">my_binary_tree&lt;T&gt;</a>(*other.<a class="code hl_variable" href="classmy__binary__tree.html#a8910dc810a9a95fe4dc308eeef739b6a">right</a>);</div>
<div class="line"><a id="l00167" name="l00167"></a><span class="lineno">  167</span>        }</div>
</div>
<div class="line"><a id="l00168" name="l00168"></a><span class="lineno">  168</span>    </div>
<div class="foldopen" id="foldopen00173" data-start="{" data-end="}">
<div class="line"><a id="l00173" name="l00173"></a><span class="lineno"><a class="line" href="classmy__binary__tree.html#aabd378c4f70ed8c8e76691769d111c59">  173</a></span>        <a class="code hl_function" href="classmy__binary__tree.html#aabd378c4f70ed8c8e76691769d111c59">~my_binary_tree</a>() {</div>
<div class="line"><a id="l00174" name="l00174"></a><span class="lineno">  174</span>            <span class="keywordflow">if</span> (<a class="code hl_variable" href="classmy__binary__tree.html#a69a6f187348e8b6219809620e784d3cf">left</a>) <span class="keyword">delete</span> <a class="code hl_variable" href="classmy__binary__tree.html#a69a6f187348e8b6219809620e784d3cf">left</a>;</div>
<div class="line"><a id="l00175" name="l00175"></a><span class="lineno">  175</span>            <span class="keywordflow">if</span> (<a class="code hl_variable" href="classmy__binary__tree.html#a8910dc810a9a95fe4dc308eeef739b6a">right</a>) <span class="keyword">delete</span> <a class="code hl_variable" href="classmy__binary__tree.html#a8910dc810a9a95fe4dc308eeef739b6a">right</a>;</div>
<div class="line"><a id="l00176" name="l00176"></a><span class="lineno">  176</span>        }</div>
</div>
<div class="line"><a id="l00177" name="l00177"></a><span class="lineno">  177</span>    </div>
<div class="line"><a id="l00186" name="l00186"></a><span class="lineno">  186</span>        <a class="code hl_class" href="classmy__binary__tree.html">my_binary_tree&lt;T&gt;</a>* <a class="code hl_function" href="classmy__binary__tree.html#a488bf2adcd7de91b9e259f6ef8c7762b">construct_binary_tree</a>(vector&lt;T&gt; values, <span class="keywordtype">int</span> index, T space);</div>
<div class="line"><a id="l00187" name="l00187"></a><span class="lineno">  187</span></div>
<div class="line"><a id="l00192" name="l00192"></a><span class="lineno">  192</span>        <span class="keywordtype">void</span> <a class="code hl_function" href="classmy__binary__tree.html#a6f45e4cb6774b092b40bee77ee80b757">mirror</a>();</div>
<div class="line"><a id="l00193" name="l00193"></a><span class="lineno">  193</span>    </div>
<div class="line"><a id="l00194" name="l00194"></a><span class="lineno">  194</span>        <span class="comment">//----------------------------------查询相关------------------------------------</span></div>
<div class="line"><a id="l00199" name="l00199"></a><span class="lineno">  199</span>        <span class="keywordtype">bool</span> <a class="code hl_function" href="classmy__binary__tree.html#a8fc393aceaa7e46fc5fb6b9377c12ea3">is_empty</a>();</div>
<div class="line"><a id="l00200" name="l00200"></a><span class="lineno">  200</span>    </div>
<div class="line"><a id="l00205" name="l00205"></a><span class="lineno">  205</span>        T <a class="code hl_function" href="classmy__binary__tree.html#a05b6069959ff87dc7824ce4e05db024a">get_value</a>();</div>
<div class="line"><a id="l00206" name="l00206"></a><span class="lineno">  206</span>    </div>
<div class="line"><a id="l00212" name="l00212"></a><span class="lineno">  212</span>        T <a class="code hl_function" href="classmy__binary__tree.html#a05b6069959ff87dc7824ce4e05db024a">get_value</a>(<span class="keywordtype">string</span> position);</div>
<div class="line"><a id="l00213" name="l00213"></a><span class="lineno">  213</span>    </div>
<div class="line"><a id="l00219" name="l00219"></a><span class="lineno">  219</span>        <span class="keywordtype">int</span> <a class="code hl_function" href="classmy__binary__tree.html#a047c1a5b1fb76a0cb62700eb1c53bb8b">get_height</a>();</div>
<div class="line"><a id="l00220" name="l00220"></a><span class="lineno">  220</span>    </div>
<div class="line"><a id="l00227" name="l00227"></a><span class="lineno">  227</span>        <span class="keywordtype">int</span> <a class="code hl_function" href="classmy__binary__tree.html#ad8ae3e1b3073a79df62de135e337192a">get_h_layer_nodes</a>(<span class="keywordtype">int</span> h);</div>
<div class="line"><a id="l00228" name="l00228"></a><span class="lineno">  228</span>    </div>
<div class="line"><a id="l00234" name="l00234"></a><span class="lineno">  234</span>        <span class="keywordtype">int</span> <a class="code hl_function" href="classmy__binary__tree.html#a76f83530b098d7ad84262d21c885c15d">get_last_layer_nodes</a>();</div>
<div class="line"><a id="l00235" name="l00235"></a><span class="lineno">  235</span>    </div>
<div class="line"><a id="l00241" name="l00241"></a><span class="lineno">  241</span>        <span class="keywordtype">int</span> <a class="code hl_function" href="classmy__binary__tree.html#aabf0c965e92e633f4d25f9b88da19a28">get_nodes_num</a>();</div>
<div class="line"><a id="l00242" name="l00242"></a><span class="lineno">  242</span>    </div>
<div class="line"><a id="l00249" name="l00249"></a><span class="lineno">  249</span>        <a class="code hl_class" href="classmy__binary__tree.html">my_binary_tree&lt;T&gt;</a>* <a class="code hl_function" href="classmy__binary__tree.html#a9279b204f13b6f6e79646fe38387607a">get_lrest_leave</a>(<span class="keywordtype">string</span> l_or_r);</div>
<div class="line"><a id="l00250" name="l00250"></a><span class="lineno">  250</span>    </div>
<div class="line"><a id="l00256" name="l00256"></a><span class="lineno">  256</span>        <span class="keywordtype">bool</span> <a class="code hl_function" href="classmy__binary__tree.html#adb685df412bb6481f5167165312868ad">is_binary_search_tree</a>();</div>
<div class="line"><a id="l00257" name="l00257"></a><span class="lineno">  257</span>    </div>
<div class="line"><a id="l00264" name="l00264"></a><span class="lineno">  264</span>        <a class="code hl_class" href="classmy__binary__tree.html">my_binary_tree&lt;T&gt;</a>* <a class="code hl_function" href="classmy__binary__tree.html#a490bf7f8ebe87b6040b1294f73979fea">find</a>(<span class="keywordtype">int</span> val);</div>
<div class="line"><a id="l00265" name="l00265"></a><span class="lineno">  265</span>    </div>
<div class="line"><a id="l00272" name="l00272"></a><span class="lineno">  272</span>        <a class="code hl_class" href="classmy__binary__tree.html">my_binary_tree&lt;T&gt;</a>* <a class="code hl_function" href="classmy__binary__tree.html#ad767eada19d83ada460c5eb0c2104056">find_father</a>(<a class="code hl_class" href="classmy__binary__tree.html">my_binary_tree&lt;T&gt;</a>* son);</div>
<div class="line"><a id="l00273" name="l00273"></a><span class="lineno">  273</span>    </div>
<div class="line"><a id="l00279" name="l00279"></a><span class="lineno">  279</span>        <span class="keywordtype">bool</span> <a class="code hl_function" href="classmy__binary__tree.html#a35c9081b6b3dfe457c8d29697ccfdfb1">is_balence_binary_tree</a>();</div>
<div class="line"><a id="l00280" name="l00280"></a><span class="lineno">  280</span>    </div>
<div class="line"><a id="l00281" name="l00281"></a><span class="lineno">  281</span>        <span class="comment">//----------------------------------增删相关------------------------------------</span></div>
<div class="line"><a id="l00288" name="l00288"></a><span class="lineno">  288</span>        <span class="keywordtype">void</span> <a class="code hl_function" href="classmy__binary__tree.html#aa23b0dbc0a4f4f7741111867f6d8b2e9">append</a>(<a class="code hl_class" href="classmy__binary__tree.html">my_binary_tree&lt;T&gt;</a>* another_tree, <span class="keywordtype">string</span> l_or_r);</div>
<div class="line"><a id="l00289" name="l00289"></a><span class="lineno">  289</span>    </div>
<div class="line"><a id="l00296" name="l00296"></a><span class="lineno">  296</span>        <span class="keywordtype">void</span> <a class="code hl_function" href="classmy__binary__tree.html#a19f020b91ef749755745ac08d69be0b6">copy</a>(<a class="code hl_class" href="classmy__binary__tree.html">my_binary_tree&lt;T&gt;</a>* des, <a class="code hl_class" href="classmy__binary__tree.html">my_binary_tree&lt;T&gt;</a>* src);</div>
<div class="line"><a id="l00297" name="l00297"></a><span class="lineno">  297</span>    </div>
<div class="line"><a id="l00304" name="l00304"></a><span class="lineno">  304</span>        <span class="keywordtype">void</span> <a class="code hl_function" href="classmy__binary__tree.html#a9675071237ce43751138c4fa3ef43657">insert</a>(T val, <span class="keywordtype">string</span> position);</div>
<div class="line"><a id="l00305" name="l00305"></a><span class="lineno">  305</span>        </div>
<div class="line"><a id="l00311" name="l00311"></a><span class="lineno">  311</span>        <span class="keywordtype">void</span> <a class="code hl_function" href="classmy__binary__tree.html#a24a14198a85ebfd603f5284ef9940e41">delete_point</a>(<a class="code hl_class" href="classmy__binary__tree.html">my_binary_tree&lt;T&gt;</a>* point);</div>
<div class="line"><a id="l00312" name="l00312"></a><span class="lineno">  312</span>    </div>
<div class="line"><a id="l00318" name="l00318"></a><span class="lineno">  318</span>        <span class="keywordtype">void</span> <a class="code hl_function" href="classmy__binary__tree.html#a5fe4fbbeb0729ef67cc258d2a5350860">delete_pos</a>(<span class="keywordtype">string</span> position);</div>
<div class="line"><a id="l00319" name="l00319"></a><span class="lineno">  319</span>        </div>
<div class="line"><a id="l00326" name="l00326"></a><span class="lineno">  326</span>        <a class="code hl_class" href="classmy__binary__tree.html">my_binary_tree&lt;T&gt;</a>* <a class="code hl_function" href="classmy__binary__tree.html#a5842011f1564adb291d8a62f1f7e7625">revolve</a>(<span class="keywordtype">string</span> mode); </div>
<div class="line"><a id="l00327" name="l00327"></a><span class="lineno">  327</span>    </div>
<div class="line"><a id="l00334" name="l00334"></a><span class="lineno"><a class="line" href="classmy__binary__tree.html#abf00c3450fd579d439c231202d2af556">  334</a></span>        <a class="code hl_function" href="classmy__binary__tree.html#ae19ca02504d47a17836f0b0c533f8982">my_binary_tree&lt;T&gt;</a>* <a class="code hl_function" href="classmy__binary__tree.html#abf00c3450fd579d439c231202d2af556">revolve</a>(<a class="code hl_function" href="classmy__binary__tree.html#ae19ca02504d47a17836f0b0c533f8982">my_binary_tree&lt;T&gt;</a>* node, <span class="keywordtype">string</span> mode);</div>
<div class="line"><a id="l00335" name="l00335"></a><span class="lineno">  335</span>        </div>
<div class="line"><a id="l00336" name="l00336"></a><span class="lineno">  336</span>    </div>
<div class="line"><a id="l00337" name="l00337"></a><span class="lineno">  337</span>        <span class="comment">//----------------------------------遍历操作------------------------------------</span></div>
<div class="line"><a id="l00343" name="l00343"></a><span class="lineno">  343</span>        <span class="keywordtype">void</span> <a class="code hl_function" href="classmy__binary__tree.html#a3b473ee42358d2ecda1958b1b72fd1dd">show_binary_tree</a>(<span class="keywordtype">string</span> mode);</div>
<div class="line"><a id="l00344" name="l00344"></a><span class="lineno">  344</span>    </div>
<div class="line"><a id="l00353" name="l00353"></a><span class="lineno">  353</span>        <span class="keyword">template</span>&lt;<span class="keyword">typename</span> Function&gt;</div>
<div class="line"><a id="l00354" name="l00354"></a><span class="lineno">  354</span>        Function <a class="code hl_function" href="classmy__binary__tree.html#a4a4f092d8f75d1f8840db3c3b4b6f36e">traversal_binary_tree</a>(<span class="keywordtype">string</span> mode, Function F);</div>
<div class="line"><a id="l00355" name="l00355"></a><span class="lineno">  355</span>    </div>
<div class="line"><a id="l00366" name="l00366"></a><span class="lineno">  366</span>        <span class="keyword">template</span>&lt;<span class="keyword">typename</span> Function1, <span class="keyword">typename</span> Function2&gt;</div>
<div class="line"><a id="l00367" name="l00367"></a><span class="lineno">  367</span>        Function1 <a class="code hl_function" href="classmy__binary__tree.html#a4a4f092d8f75d1f8840db3c3b4b6f36e">traversal_binary_tree</a>(<span class="keywordtype">string</span> mode, Function1 F1, Function2 F2);</div>
<div class="line"><a id="l00368" name="l00368"></a><span class="lineno">  368</span>    </div>
<div class="line"><a id="l00374" name="l00374"></a><span class="lineno">  374</span>        <span class="keywordtype">void</span> <a class="code hl_function" href="classmy__binary__tree.html#aff9c3c138c4fc970016a826ec0653eaf">print_full_to_vector</a>(vector&lt;T&gt;&amp; vv);</div>
<div class="line"><a id="l00375" name="l00375"></a><span class="lineno">  375</span>    </div>
<div class="line"><a id="l00381" name="l00381"></a><span class="lineno">  381</span>        <span class="keywordtype">void</span> <a class="code hl_function" href="classmy__binary__tree.html#aa65e9e0bae93b835e20c32de429928d3">print_to_vector</a>(vector&lt;T&gt;&amp; vv);</div>
<div class="line"><a id="l00382" name="l00382"></a><span class="lineno">  382</span>    </div>
<div class="line"><a id="l00383" name="l00383"></a><span class="lineno">  383</span>        <span class="comment">//----------------------------------操作符重载------------------------------------</span></div>
<div class="foldopen" id="foldopen00390" data-start="{" data-end="}">
<div class="line"><a id="l00390" name="l00390"></a><span class="lineno"><a class="line" href="classmy__binary__tree.html#aedeb2af1e014d361fb7c2f1423e9f58d">  390</a></span>        <a class="code hl_function" href="classmy__binary__tree.html#ae19ca02504d47a17836f0b0c533f8982">my_binary_tree&lt;T&gt;</a>&amp; <a class="code hl_function" href="classmy__binary__tree.html#aedeb2af1e014d361fb7c2f1423e9f58d">operator=</a>(<a class="code hl_function" href="classmy__binary__tree.html#ae19ca02504d47a17836f0b0c533f8982">my_binary_tree&lt;T&gt;</a>&amp; other) {</div>
<div class="line"><a id="l00391" name="l00391"></a><span class="lineno">  391</span>            <span class="keywordflow">if</span> (<span class="keyword">this</span> != &amp;other) {</div>
<div class="line"><a id="l00392" name="l00392"></a><span class="lineno">  392</span>                <a class="code hl_variable" href="classmy__binary__tree.html#ae2d15edcaec6e5543a5e8c64ea0173cb">data</a> = other.<a class="code hl_variable" href="classmy__binary__tree.html#ae2d15edcaec6e5543a5e8c64ea0173cb">data</a>;</div>
<div class="line"><a id="l00393" name="l00393"></a><span class="lineno">  393</span>                <span class="keywordflow">if</span> (<a class="code hl_variable" href="classmy__binary__tree.html#a69a6f187348e8b6219809620e784d3cf">left</a>) <span class="keyword">delete</span> <a class="code hl_variable" href="classmy__binary__tree.html#a69a6f187348e8b6219809620e784d3cf">left</a>;</div>
<div class="line"><a id="l00394" name="l00394"></a><span class="lineno">  394</span>                <span class="keywordflow">if</span> (<a class="code hl_variable" href="classmy__binary__tree.html#a8910dc810a9a95fe4dc308eeef739b6a">right</a>) <span class="keyword">delete</span> <a class="code hl_variable" href="classmy__binary__tree.html#a8910dc810a9a95fe4dc308eeef739b6a">right</a>;</div>
<div class="line"><a id="l00395" name="l00395"></a><span class="lineno">  395</span>                <span class="keywordflow">if</span> (other.<a class="code hl_variable" href="classmy__binary__tree.html#a69a6f187348e8b6219809620e784d3cf">left</a>) <a class="code hl_variable" href="classmy__binary__tree.html#a69a6f187348e8b6219809620e784d3cf">left</a> = <span class="keyword">new</span> <a class="code hl_function" href="classmy__binary__tree.html#ae19ca02504d47a17836f0b0c533f8982">my_binary_tree&lt;T&gt;</a>(*other.<a class="code hl_variable" href="classmy__binary__tree.html#a69a6f187348e8b6219809620e784d3cf">left</a>);</div>
<div class="line"><a id="l00396" name="l00396"></a><span class="lineno">  396</span>                <span class="keywordflow">if</span> (other.<a class="code hl_variable" href="classmy__binary__tree.html#a8910dc810a9a95fe4dc308eeef739b6a">right</a>) <a class="code hl_variable" href="classmy__binary__tree.html#a8910dc810a9a95fe4dc308eeef739b6a">right</a> = <span class="keyword">new</span> <a class="code hl_function" href="classmy__binary__tree.html#ae19ca02504d47a17836f0b0c533f8982">my_binary_tree&lt;T&gt;</a>(*other.<a class="code hl_variable" href="classmy__binary__tree.html#a8910dc810a9a95fe4dc308eeef739b6a">right</a>);</div>
<div class="line"><a id="l00397" name="l00397"></a><span class="lineno">  397</span>            }</div>
<div class="line"><a id="l00398" name="l00398"></a><span class="lineno">  398</span>            <span class="keywordflow">return</span> *<span class="keyword">this</span>;</div>
<div class="line"><a id="l00399" name="l00399"></a><span class="lineno">  399</span>        }</div>
</div>
<div class="line"><a id="l00400" name="l00400"></a><span class="lineno">  400</span>    </div>
<div class="line"><a id="l00408" name="l00408"></a><span class="lineno">  408</span>        <span class="keyword">friend</span> <span class="keywordtype">bool</span> <a class="code hl_friend" href="classmy__binary__tree.html#a9b5581a82079878a7faac62d07bbcc12">operator==&lt;&gt;</a>(<a class="code hl_class" href="classmy__binary__tree.html">my_binary_tree&lt;T&gt;</a> lhs, <a class="code hl_class" href="classmy__binary__tree.html">my_binary_tree&lt;T&gt;</a> rhs);</div>
<div class="line"><a id="l00409" name="l00409"></a><span class="lineno">  409</span>    </div>
<div class="line"><a id="l00417" name="l00417"></a><span class="lineno">  417</span>        <span class="keyword">friend</span> <span class="keywordtype">bool</span> <a class="code hl_friend" href="classmy__binary__tree.html#a57bcf0e8e11dcb2db4d3c2b72e62d913">operator!=&lt;&gt;</a>(<a class="code hl_class" href="classmy__binary__tree.html">my_binary_tree&lt;T&gt;</a> lhs, <a class="code hl_class" href="classmy__binary__tree.html">my_binary_tree&lt;T&gt;</a> rhs);</div>
<div class="line"><a id="l00418" name="l00418"></a><span class="lineno">  418</span>    </div>
<div class="line"><a id="l00426" name="l00426"></a><span class="lineno">  426</span>        <span class="keyword">friend</span> ostream&amp; operator&lt;&lt;&lt;&gt;(ostream&amp; os, <a class="code hl_class" href="classmy__binary__tree.html">my_binary_tree&lt;T&gt;</a> p);</div>
<div class="line"><a id="l00427" name="l00427"></a><span class="lineno">  427</span>        </div>
<div class="foldopen" id="foldopen00434" data-start="{" data-end="}">
<div class="line"><a id="l00434" name="l00434"></a><span class="lineno"><a class="line" href="classmy__binary__tree.html#a52db051eb0ccae70e61baf638acd2f81">  434</a></span>        T <a class="code hl_function" href="classmy__binary__tree.html#a52db051eb0ccae70e61baf638acd2f81">operator[]</a>(<span class="keywordtype">int</span> index){</div>
<div class="line"><a id="l00435" name="l00435"></a><span class="lineno">  435</span>            <span class="keywordtype">int</span> height = <a class="code hl_function" href="classmy__binary__tree.html#a047c1a5b1fb76a0cb62700eb1c53bb8b">get_height</a>();</div>
<div class="line"><a id="l00436" name="l00436"></a><span class="lineno">  436</span>            <span class="keywordtype">int</span> h = 1;</div>
<div class="line"><a id="l00437" name="l00437"></a><span class="lineno">  437</span>            <span class="keywordtype">int</span> sum = pow(2, height) - 1;</div>
<div class="line"><a id="l00438" name="l00438"></a><span class="lineno">  438</span>            <span class="keywordtype">int</span> i = 0;</div>
<div class="line"><a id="l00439" name="l00439"></a><span class="lineno">  439</span>            vector&lt;T&gt; vv(sum, space);  <span class="comment">// 初始化向量为占位符</span></div>
<div class="line"><a id="l00440" name="l00440"></a><span class="lineno">  440</span>            <a class="code hl_function" href="classmy__binary__tree.html#aa65e9e0bae93b835e20c32de429928d3">print_to_vector</a>(vv);</div>
<div class="line"><a id="l00441" name="l00441"></a><span class="lineno">  441</span>            <span class="keywordflow">return</span> vv[index];</div>
<div class="line"><a id="l00442" name="l00442"></a><span class="lineno">  442</span>        }</div>
</div>
<div class="line"><a id="l00443" name="l00443"></a><span class="lineno">  443</span>};</div>
</div>
<div class="line"><a id="l00444" name="l00444"></a><span class="lineno">  444</span> </div>
<div class="line"><a id="l00445" name="l00445"></a><span class="lineno">  445</span><span class="comment">//定义主类的函数</span></div>
<div class="line"><a id="l00446" name="l00446"></a><span class="lineno">  446</span><span class="comment">//----------------------------------构造相关------------------------------------</span></div>
<div class="line"><a id="l00447" name="l00447"></a><span class="lineno">  447</span><span class="comment">// 层先法构造二叉树的函数</span></div>
<div class="line"><a id="l00448" name="l00448"></a><span class="lineno">  448</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T&gt;</div>
<div class="foldopen" id="foldopen00449" data-start="{" data-end="}">
<div class="line"><a id="l00449" name="l00449"></a><span class="lineno"><a class="line" href="classmy__binary__tree.html#a488bf2adcd7de91b9e259f6ef8c7762b">  449</a></span><a class="code hl_function" href="classmy__binary__tree.html#ae19ca02504d47a17836f0b0c533f8982">my_binary_tree&lt;T&gt;</a>* <a class="code hl_function" href="classmy__binary__tree.html#a488bf2adcd7de91b9e259f6ef8c7762b">my_binary_tree&lt;T&gt;::construct_binary_tree</a>(vector&lt;T&gt; values, <span class="keywordtype">int</span> index, T space) {</div>
<div class="line"><a id="l00450" name="l00450"></a><span class="lineno">  450</span>    <span class="keywordflow">if</span> (index &gt;= values.size()) {</div>
<div class="line"><a id="l00451" name="l00451"></a><span class="lineno">  451</span>        <span class="keywordflow">return</span> NULL;</div>
<div class="line"><a id="l00452" name="l00452"></a><span class="lineno">  452</span>    }</div>
<div class="line"><a id="l00453" name="l00453"></a><span class="lineno">  453</span>    <span class="keywordflow">if</span> (values[index] == space) {</div>
<div class="line"><a id="l00454" name="l00454"></a><span class="lineno">  454</span>        <a class="code hl_function" href="classmy__binary__tree.html#ae19ca02504d47a17836f0b0c533f8982">my_binary_tree&lt;T&gt;</a>* node = NULL;</div>
<div class="line"><a id="l00455" name="l00455"></a><span class="lineno">  455</span>        <span class="keywordflow">return</span> node;</div>
<div class="line"><a id="l00456" name="l00456"></a><span class="lineno">  456</span>    } <span class="keywordflow">else</span> {</div>
<div class="line"><a id="l00457" name="l00457"></a><span class="lineno">  457</span>        <a class="code hl_function" href="classmy__binary__tree.html#ae19ca02504d47a17836f0b0c533f8982">my_binary_tree&lt;T&gt;</a>* node = <span class="keyword">new</span> <a class="code hl_function" href="classmy__binary__tree.html#ae19ca02504d47a17836f0b0c533f8982">my_binary_tree</a>(values[index]);</div>
<div class="line"><a id="l00458" name="l00458"></a><span class="lineno">  458</span>        <span class="comment">// 注意：原代码此处调用construct_full_binary_tree可能是笔误，修正为construct_binary_tree</span></div>
<div class="line"><a id="l00459" name="l00459"></a><span class="lineno">  459</span>        node-&gt;<a class="code hl_variable" href="classmy__binary__tree.html#a69a6f187348e8b6219809620e784d3cf">left</a> = <a class="code hl_function" href="classmy__binary__tree.html#a488bf2adcd7de91b9e259f6ef8c7762b">construct_binary_tree</a>(values, 2 * index + 1, space);</div>
<div class="line"><a id="l00460" name="l00460"></a><span class="lineno">  460</span>        node-&gt;<a class="code hl_variable" href="classmy__binary__tree.html#a8910dc810a9a95fe4dc308eeef739b6a">right</a> = <a class="code hl_function" href="classmy__binary__tree.html#a488bf2adcd7de91b9e259f6ef8c7762b">construct_binary_tree</a>(values, 2 * index + 2, space);</div>
<div class="line"><a id="l00461" name="l00461"></a><span class="lineno">  461</span>        <span class="keywordflow">return</span> node;</div>
<div class="line"><a id="l00462" name="l00462"></a><span class="lineno">  462</span>    }</div>
<div class="line"><a id="l00463" name="l00463"></a><span class="lineno">  463</span>}</div>
</div>
<div class="line"><a id="l00464" name="l00464"></a><span class="lineno">  464</span> </div>
<div class="line"><a id="l00465" name="l00465"></a><span class="lineno">  465</span> </div>
<div class="line"><a id="l00466" name="l00466"></a><span class="lineno">  466</span><span class="comment">//镜像</span></div>
<div class="line"><a id="l00467" name="l00467"></a><span class="lineno">  467</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T&gt;</div>
<div class="foldopen" id="foldopen00468" data-start="{" data-end="}">
<div class="line"><a id="l00468" name="l00468"></a><span class="lineno"><a class="line" href="classmy__binary__tree.html#a6f45e4cb6774b092b40bee77ee80b757">  468</a></span><span class="keywordtype">void</span> <a class="code hl_function" href="classmy__binary__tree.html#a6f45e4cb6774b092b40bee77ee80b757">my_binary_tree&lt;T&gt;::mirror</a>() {</div>
<div class="line"><a id="l00469" name="l00469"></a><span class="lineno">  469</span>    <span class="keywordflow">if</span> (!<span class="keyword">this</span>) <span class="keywordflow">return</span>;</div>
<div class="line"><a id="l00470" name="l00470"></a><span class="lineno">  470</span>    swap(<a class="code hl_variable" href="classmy__binary__tree.html#a69a6f187348e8b6219809620e784d3cf">left</a>, <a class="code hl_variable" href="classmy__binary__tree.html#a8910dc810a9a95fe4dc308eeef739b6a">right</a>);</div>
<div class="line"><a id="l00471" name="l00471"></a><span class="lineno">  471</span>    <span class="keywordflow">if</span> (<a class="code hl_variable" href="classmy__binary__tree.html#a69a6f187348e8b6219809620e784d3cf">left</a>) <a class="code hl_variable" href="classmy__binary__tree.html#a69a6f187348e8b6219809620e784d3cf">left</a>-&gt;mirror();  <span class="comment">// 避免空指针调用（原代码直接调用可能崩溃）</span></div>
<div class="line"><a id="l00472" name="l00472"></a><span class="lineno">  472</span>    <span class="keywordflow">if</span> (<a class="code hl_variable" href="classmy__binary__tree.html#a8910dc810a9a95fe4dc308eeef739b6a">right</a>) <a class="code hl_variable" href="classmy__binary__tree.html#a8910dc810a9a95fe4dc308eeef739b6a">right</a>-&gt;mirror();</div>
<div class="line"><a id="l00473" name="l00473"></a><span class="lineno">  473</span>}</div>
</div>
<div class="line"><a id="l00474" name="l00474"></a><span class="lineno">  474</span> </div>
<div class="line"><a id="l00475" name="l00475"></a><span class="lineno">  475</span><span class="comment">//----------------------------------查询相关------------------------------------</span></div>
<div class="line"><a id="l00476" name="l00476"></a><span class="lineno">  476</span><span class="comment">//查询空</span></div>
<div class="line"><a id="l00477" name="l00477"></a><span class="lineno">  477</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T&gt;</div>
<div class="foldopen" id="foldopen00478" data-start="{" data-end="}">
<div class="line"><a id="l00478" name="l00478"></a><span class="lineno"><a class="line" href="classmy__binary__tree.html#a8fc393aceaa7e46fc5fb6b9377c12ea3">  478</a></span><span class="keywordtype">bool</span> <a class="code hl_function" href="classmy__binary__tree.html#a8fc393aceaa7e46fc5fb6b9377c12ea3">my_binary_tree&lt;T&gt;::is_empty</a>() {</div>
<div class="line"><a id="l00479" name="l00479"></a><span class="lineno">  479</span>    <span class="keywordflow">return</span> <span class="keyword">this</span> == NULL;</div>
<div class="line"><a id="l00480" name="l00480"></a><span class="lineno">  480</span>}</div>
</div>
<div class="line"><a id="l00481" name="l00481"></a><span class="lineno">  481</span> </div>
<div class="line"><a id="l00482" name="l00482"></a><span class="lineno">  482</span><span class="comment">//查询根节点值</span></div>
<div class="line"><a id="l00483" name="l00483"></a><span class="lineno">  483</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T&gt;</div>
<div class="foldopen" id="foldopen00484" data-start="{" data-end="}">
<div class="line"><a id="l00484" name="l00484"></a><span class="lineno"><a class="line" href="classmy__binary__tree.html#a05b6069959ff87dc7824ce4e05db024a">  484</a></span>T <a class="code hl_function" href="classmy__binary__tree.html#a05b6069959ff87dc7824ce4e05db024a">my_binary_tree&lt;T&gt;::get_value</a>() {</div>
<div class="line"><a id="l00485" name="l00485"></a><span class="lineno">  485</span>    cout &lt;&lt; <a class="code hl_variable" href="classmy__binary__tree.html#ae2d15edcaec6e5543a5e8c64ea0173cb">data</a> &lt;&lt; endl;</div>
<div class="line"><a id="l00486" name="l00486"></a><span class="lineno">  486</span>    <span class="keywordflow">return</span> <a class="code hl_variable" href="classmy__binary__tree.html#ae2d15edcaec6e5543a5e8c64ea0173cb">data</a>;   </div>
<div class="line"><a id="l00487" name="l00487"></a><span class="lineno">  487</span>}</div>
</div>
<div class="line"><a id="l00488" name="l00488"></a><span class="lineno">  488</span> </div>
<div class="line"><a id="l00489" name="l00489"></a><span class="lineno">  489</span><span class="comment">//查询position节点值</span></div>
<div class="line"><a id="l00490" name="l00490"></a><span class="lineno">  490</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T&gt;</div>
<div class="foldopen" id="foldopen00491" data-start="{" data-end="}">
<div class="line"><a id="l00491" name="l00491"></a><span class="lineno"><a class="line" href="classmy__binary__tree.html#ace03005196f04451f9af5c2ab663a990">  491</a></span>T <a class="code hl_function" href="classmy__binary__tree.html#a05b6069959ff87dc7824ce4e05db024a">my_binary_tree&lt;T&gt;::get_value</a>(<span class="keywordtype">string</span> position){</div>
<div class="line"><a id="l00492" name="l00492"></a><span class="lineno">  492</span>    <span class="keywordtype">int</span> <span class="keywordtype">size_t</span>=position.size();</div>
<div class="line"><a id="l00493" name="l00493"></a><span class="lineno">  493</span>    <span class="keywordtype">int</span> i=0;</div>
<div class="line"><a id="l00494" name="l00494"></a><span class="lineno">  494</span>    <span class="keywordtype">int</span> height=<a class="code hl_function" href="classmy__binary__tree.html#a047c1a5b1fb76a0cb62700eb1c53bb8b">get_height</a>();</div>
<div class="line"><a id="l00495" name="l00495"></a><span class="lineno">  495</span>    T value=0;</div>
<div class="line"><a id="l00496" name="l00496"></a><span class="lineno">  496</span>    <a class="code hl_function" href="classmy__binary__tree.html#ae19ca02504d47a17836f0b0c533f8982">my_binary_tree&lt;T&gt;</a>* p=<span class="keyword">this</span>;</div>
<div class="line"><a id="l00497" name="l00497"></a><span class="lineno">  497</span>    <span class="keywordflow">while</span>(i&lt;height-1&amp;&amp;i&lt;<span class="keywordtype">size_t</span>){</div>
<div class="line"><a id="l00498" name="l00498"></a><span class="lineno">  498</span>        <span class="keywordflow">if</span>(position[i]==<span class="charliteral">&#39;1&#39;</span>){</div>
<div class="line"><a id="l00499" name="l00499"></a><span class="lineno">  499</span>            p=p-&gt;<a class="code hl_variable" href="classmy__binary__tree.html#a69a6f187348e8b6219809620e784d3cf">left</a>;</div>
<div class="line"><a id="l00500" name="l00500"></a><span class="lineno">  500</span>        }</div>
<div class="line"><a id="l00501" name="l00501"></a><span class="lineno">  501</span>        <span class="keywordflow">if</span>(position[i]==<span class="charliteral">&#39;0&#39;</span>){</div>
<div class="line"><a id="l00502" name="l00502"></a><span class="lineno">  502</span>            p=p-&gt;<a class="code hl_variable" href="classmy__binary__tree.html#a8910dc810a9a95fe4dc308eeef739b6a">right</a>;</div>
<div class="line"><a id="l00503" name="l00503"></a><span class="lineno">  503</span>        }</div>
<div class="line"><a id="l00504" name="l00504"></a><span class="lineno">  504</span>        i++;</div>
<div class="line"><a id="l00505" name="l00505"></a><span class="lineno">  505</span>    }</div>
<div class="line"><a id="l00506" name="l00506"></a><span class="lineno">  506</span>    value=p-&gt;<a class="code hl_variable" href="classmy__binary__tree.html#ae2d15edcaec6e5543a5e8c64ea0173cb">data</a>;</div>
<div class="line"><a id="l00507" name="l00507"></a><span class="lineno">  507</span>    <span class="keyword">delete</span> p;</div>
<div class="line"><a id="l00508" name="l00508"></a><span class="lineno">  508</span>    cout&lt;&lt;value&lt;&lt;endl;</div>
<div class="line"><a id="l00509" name="l00509"></a><span class="lineno">  509</span>    <span class="keywordflow">return</span> value;</div>
<div class="line"><a id="l00510" name="l00510"></a><span class="lineno">  510</span>} </div>
</div>
<div class="line"><a id="l00511" name="l00511"></a><span class="lineno">  511</span> </div>
<div class="line"><a id="l00512" name="l00512"></a><span class="lineno">  512</span><span class="comment">//查询树高</span></div>
<div class="line"><a id="l00513" name="l00513"></a><span class="lineno">  513</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T&gt;</div>
<div class="foldopen" id="foldopen00514" data-start="{" data-end="}">
<div class="line"><a id="l00514" name="l00514"></a><span class="lineno"><a class="line" href="classmy__binary__tree.html#a047c1a5b1fb76a0cb62700eb1c53bb8b">  514</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="classmy__binary__tree.html#a047c1a5b1fb76a0cb62700eb1c53bb8b">my_binary_tree&lt;T&gt;::get_height</a>() {</div>
<div class="line"><a id="l00515" name="l00515"></a><span class="lineno">  515</span>    <span class="keywordflow">if</span> (<span class="keyword">this</span> == NULL) {</div>
<div class="line"><a id="l00516" name="l00516"></a><span class="lineno">  516</span>        <span class="keywordflow">return</span> 0;</div>
<div class="line"><a id="l00517" name="l00517"></a><span class="lineno">  517</span>    }</div>
<div class="line"><a id="l00518" name="l00518"></a><span class="lineno">  518</span>    <span class="keywordflow">if</span> (<a class="code hl_variable" href="classmy__binary__tree.html#a69a6f187348e8b6219809620e784d3cf">left</a> == NULL &amp;&amp; <a class="code hl_variable" href="classmy__binary__tree.html#a8910dc810a9a95fe4dc308eeef739b6a">right</a> == NULL) {</div>
<div class="line"><a id="l00519" name="l00519"></a><span class="lineno">  519</span>        <span class="keywordflow">return</span> 1;</div>
<div class="line"><a id="l00520" name="l00520"></a><span class="lineno">  520</span>    }</div>
<div class="line"><a id="l00521" name="l00521"></a><span class="lineno">  521</span>    <span class="keywordtype">int</span> left_h = (<a class="code hl_variable" href="classmy__binary__tree.html#a69a6f187348e8b6219809620e784d3cf">left</a> ? <a class="code hl_variable" href="classmy__binary__tree.html#a69a6f187348e8b6219809620e784d3cf">left</a>-&gt;get_height() : 0);  <span class="comment">// 避免空指针调用</span></div>
<div class="line"><a id="l00522" name="l00522"></a><span class="lineno">  522</span>    <span class="keywordtype">int</span> right_h = (<a class="code hl_variable" href="classmy__binary__tree.html#a8910dc810a9a95fe4dc308eeef739b6a">right</a> ? <a class="code hl_variable" href="classmy__binary__tree.html#a8910dc810a9a95fe4dc308eeef739b6a">right</a>-&gt;get_height() : 0);</div>
<div class="line"><a id="l00523" name="l00523"></a><span class="lineno">  523</span>    <span class="keywordflow">return</span> 1 + max(left_h, right_h);</div>
<div class="line"><a id="l00524" name="l00524"></a><span class="lineno">  524</span>}</div>
</div>
<div class="line"><a id="l00525" name="l00525"></a><span class="lineno">  525</span> </div>
<div class="line"><a id="l00526" name="l00526"></a><span class="lineno">  526</span><span class="comment">//查询h层节点数</span></div>
<div class="line"><a id="l00527" name="l00527"></a><span class="lineno">  527</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T&gt;</div>
<div class="foldopen" id="foldopen00528" data-start="{" data-end="}">
<div class="line"><a id="l00528" name="l00528"></a><span class="lineno"><a class="line" href="classmy__binary__tree.html#ad8ae3e1b3073a79df62de135e337192a">  528</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="classmy__binary__tree.html#ad8ae3e1b3073a79df62de135e337192a">my_binary_tree&lt;T&gt;::get_h_layer_nodes</a>(<span class="keywordtype">int</span> h) {</div>
<div class="line"><a id="l00529" name="l00529"></a><span class="lineno">  529</span>    <span class="keywordtype">int</span> height = <a class="code hl_function" href="classmy__binary__tree.html#a047c1a5b1fb76a0cb62700eb1c53bb8b">get_height</a>();</div>
<div class="line"><a id="l00530" name="l00530"></a><span class="lineno">  530</span>    assert((h &gt;= 1) &amp;&amp; (h &lt;= height) &amp;&amp; <span class="stringliteral">&quot;h &lt; 1 || h &gt; height&quot;</span>);</div>
<div class="line"><a id="l00531" name="l00531"></a><span class="lineno">  531</span>    <span class="keywordflow">if</span> (h == 1) {</div>
<div class="line"><a id="l00532" name="l00532"></a><span class="lineno">  532</span>        <span class="keywordflow">return</span> 1;</div>
<div class="line"><a id="l00533" name="l00533"></a><span class="lineno">  533</span>    } <span class="keywordflow">else</span> {</div>
<div class="line"><a id="l00534" name="l00534"></a><span class="lineno">  534</span>        <span class="keywordtype">int</span> num = 0;</div>
<div class="line"><a id="l00535" name="l00535"></a><span class="lineno">  535</span>        <span class="keywordtype">int</span> current_level = 1;</div>
<div class="line"><a id="l00536" name="l00536"></a><span class="lineno">  536</span>        queue&lt;my_binary_tree&lt;T&gt;*&gt; q;</div>
<div class="line"><a id="l00537" name="l00537"></a><span class="lineno">  537</span>        q.push(<span class="keyword">this</span>);</div>
<div class="line"><a id="l00538" name="l00538"></a><span class="lineno">  538</span>        <span class="keywordflow">while</span> (<span class="keyword">true</span>) {</div>
<div class="line"><a id="l00539" name="l00539"></a><span class="lineno">  539</span>            num = q.size();</div>
<div class="line"><a id="l00540" name="l00540"></a><span class="lineno">  540</span>            <span class="keywordflow">if</span> (current_level == h) {</div>
<div class="line"><a id="l00541" name="l00541"></a><span class="lineno">  541</span>                <span class="keywordflow">break</span>;</div>
<div class="line"><a id="l00542" name="l00542"></a><span class="lineno">  542</span>            }</div>
<div class="line"><a id="l00543" name="l00543"></a><span class="lineno">  543</span>            <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; num; i++) {</div>
<div class="line"><a id="l00544" name="l00544"></a><span class="lineno">  544</span>                <a class="code hl_function" href="classmy__binary__tree.html#ae19ca02504d47a17836f0b0c533f8982">my_binary_tree&lt;T&gt;</a>* front = q.front();</div>
<div class="line"><a id="l00545" name="l00545"></a><span class="lineno">  545</span>                <span class="keywordflow">if</span> (front-&gt;<a class="code hl_variable" href="classmy__binary__tree.html#a69a6f187348e8b6219809620e784d3cf">left</a>) {</div>
<div class="line"><a id="l00546" name="l00546"></a><span class="lineno">  546</span>                    q.push(front-&gt;<a class="code hl_variable" href="classmy__binary__tree.html#a69a6f187348e8b6219809620e784d3cf">left</a>);</div>
<div class="line"><a id="l00547" name="l00547"></a><span class="lineno">  547</span>                }</div>
<div class="line"><a id="l00548" name="l00548"></a><span class="lineno">  548</span>                <span class="keywordflow">if</span> (front-&gt;<a class="code hl_variable" href="classmy__binary__tree.html#a8910dc810a9a95fe4dc308eeef739b6a">right</a>) {</div>
<div class="line"><a id="l00549" name="l00549"></a><span class="lineno">  549</span>                    q.push(front-&gt;<a class="code hl_variable" href="classmy__binary__tree.html#a8910dc810a9a95fe4dc308eeef739b6a">right</a>);</div>
<div class="line"><a id="l00550" name="l00550"></a><span class="lineno">  550</span>                }</div>
<div class="line"><a id="l00551" name="l00551"></a><span class="lineno">  551</span>                q.pop();</div>
<div class="line"><a id="l00552" name="l00552"></a><span class="lineno">  552</span>            }</div>
<div class="line"><a id="l00553" name="l00553"></a><span class="lineno">  553</span>            current_level++;</div>
<div class="line"><a id="l00554" name="l00554"></a><span class="lineno">  554</span>        }</div>
<div class="line"><a id="l00555" name="l00555"></a><span class="lineno">  555</span>        <span class="keywordflow">return</span> num;</div>
<div class="line"><a id="l00556" name="l00556"></a><span class="lineno">  556</span>    }</div>
<div class="line"><a id="l00557" name="l00557"></a><span class="lineno">  557</span>}</div>
</div>
<div class="line"><a id="l00558" name="l00558"></a><span class="lineno">  558</span> </div>
<div class="line"><a id="l00559" name="l00559"></a><span class="lineno">  559</span><span class="comment">//查询最后一层叶子数</span></div>
<div class="line"><a id="l00560" name="l00560"></a><span class="lineno">  560</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T&gt;</div>
<div class="foldopen" id="foldopen00561" data-start="{" data-end="}">
<div class="line"><a id="l00561" name="l00561"></a><span class="lineno"><a class="line" href="classmy__binary__tree.html#a76f83530b098d7ad84262d21c885c15d">  561</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="classmy__binary__tree.html#a76f83530b098d7ad84262d21c885c15d">my_binary_tree&lt;T&gt;::get_last_layer_nodes</a>() {</div>
<div class="line"><a id="l00562" name="l00562"></a><span class="lineno">  562</span>    <span class="keywordtype">int</span> h = <a class="code hl_function" href="classmy__binary__tree.html#a047c1a5b1fb76a0cb62700eb1c53bb8b">get_height</a>();</div>
<div class="line"><a id="l00563" name="l00563"></a><span class="lineno">  563</span>    <span class="keywordflow">return</span> <a class="code hl_function" href="classmy__binary__tree.html#ad8ae3e1b3073a79df62de135e337192a">get_h_layer_nodes</a>(h);</div>
<div class="line"><a id="l00564" name="l00564"></a><span class="lineno">  564</span>}</div>
</div>
<div class="line"><a id="l00565" name="l00565"></a><span class="lineno">  565</span> </div>
<div class="line"><a id="l00566" name="l00566"></a><span class="lineno">  566</span><span class="comment">//查询总节点数</span></div>
<div class="line"><a id="l00567" name="l00567"></a><span class="lineno">  567</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T&gt;</div>
<div class="foldopen" id="foldopen00568" data-start="{" data-end="}">
<div class="line"><a id="l00568" name="l00568"></a><span class="lineno"><a class="line" href="classmy__binary__tree.html#aabf0c965e92e633f4d25f9b88da19a28">  568</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="classmy__binary__tree.html#aabf0c965e92e633f4d25f9b88da19a28">my_binary_tree&lt;T&gt;::get_nodes_num</a>() {</div>
<div class="line"><a id="l00569" name="l00569"></a><span class="lineno">  569</span>    <span class="keywordtype">int</span> height = <a class="code hl_function" href="classmy__binary__tree.html#a047c1a5b1fb76a0cb62700eb1c53bb8b">get_height</a>();</div>
<div class="line"><a id="l00570" name="l00570"></a><span class="lineno">  570</span>    <span class="keywordtype">int</span> sum = 0;</div>
<div class="line"><a id="l00571" name="l00571"></a><span class="lineno">  571</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 1; i &lt;= height; i++) {</div>
<div class="line"><a id="l00572" name="l00572"></a><span class="lineno">  572</span>        sum += <a class="code hl_function" href="classmy__binary__tree.html#ad8ae3e1b3073a79df62de135e337192a">get_h_layer_nodes</a>(i);</div>
<div class="line"><a id="l00573" name="l00573"></a><span class="lineno">  573</span>    }</div>
<div class="line"><a id="l00574" name="l00574"></a><span class="lineno">  574</span>    <span class="keywordflow">return</span> sum;</div>
<div class="line"><a id="l00575" name="l00575"></a><span class="lineno">  575</span>}</div>
</div>
<div class="line"><a id="l00576" name="l00576"></a><span class="lineno">  576</span> </div>
<div class="line"><a id="l00577" name="l00577"></a><span class="lineno">  577</span><span class="comment">//查询最左/右叶子</span></div>
<div class="line"><a id="l00578" name="l00578"></a><span class="lineno">  578</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T&gt;</div>
<div class="foldopen" id="foldopen00579" data-start="{" data-end="}">
<div class="line"><a id="l00579" name="l00579"></a><span class="lineno"><a class="line" href="classmy__binary__tree.html#a9279b204f13b6f6e79646fe38387607a">  579</a></span><a class="code hl_function" href="classmy__binary__tree.html#ae19ca02504d47a17836f0b0c533f8982">my_binary_tree&lt;T&gt;</a>* <a class="code hl_function" href="classmy__binary__tree.html#a9279b204f13b6f6e79646fe38387607a">my_binary_tree&lt;T&gt;::get_lrest_leave</a>(<span class="keywordtype">string</span> l_or_r) {</div>
<div class="line"><a id="l00580" name="l00580"></a><span class="lineno">  580</span>    <a class="code hl_function" href="classmy__binary__tree.html#ae19ca02504d47a17836f0b0c533f8982">my_binary_tree&lt;T&gt;</a>* p = <span class="keyword">this</span>;</div>
<div class="line"><a id="l00581" name="l00581"></a><span class="lineno">  581</span>    <span class="keywordflow">if</span> (l_or_r == <span class="stringliteral">&quot;left&quot;</span>) {</div>
<div class="line"><a id="l00582" name="l00582"></a><span class="lineno">  582</span>        <span class="keywordflow">while</span> (p &amp;&amp; p-&gt;<a class="code hl_variable" href="classmy__binary__tree.html#a69a6f187348e8b6219809620e784d3cf">left</a> != NULL) {  <span class="comment">// 增加p非空判断，避免空指针</span></div>
<div class="line"><a id="l00583" name="l00583"></a><span class="lineno">  583</span>            p = p-&gt;<a class="code hl_variable" href="classmy__binary__tree.html#a69a6f187348e8b6219809620e784d3cf">left</a>;</div>
<div class="line"><a id="l00584" name="l00584"></a><span class="lineno">  584</span>        }</div>
<div class="line"><a id="l00585" name="l00585"></a><span class="lineno">  585</span>        <span class="keywordflow">return</span> p;</div>
<div class="line"><a id="l00586" name="l00586"></a><span class="lineno">  586</span>    }</div>
<div class="line"><a id="l00587" name="l00587"></a><span class="lineno">  587</span>    <span class="keywordflow">if</span> (l_or_r == <span class="stringliteral">&quot;right&quot;</span>) {</div>
<div class="line"><a id="l00588" name="l00588"></a><span class="lineno">  588</span>        <span class="keywordflow">while</span> (p &amp;&amp; p-&gt;<a class="code hl_variable" href="classmy__binary__tree.html#a8910dc810a9a95fe4dc308eeef739b6a">right</a> != NULL) {  <span class="comment">// 增加p非空判断，避免空指针</span></div>
<div class="line"><a id="l00589" name="l00589"></a><span class="lineno">  589</span>            p = p-&gt;<a class="code hl_variable" href="classmy__binary__tree.html#a8910dc810a9a95fe4dc308eeef739b6a">right</a>;</div>
<div class="line"><a id="l00590" name="l00590"></a><span class="lineno">  590</span>        }</div>
<div class="line"><a id="l00591" name="l00591"></a><span class="lineno">  591</span>        <span class="keywordflow">return</span> p;</div>
<div class="line"><a id="l00592" name="l00592"></a><span class="lineno">  592</span>    }</div>
<div class="line"><a id="l00593" name="l00593"></a><span class="lineno">  593</span>    <span class="keywordflow">return</span> p;</div>
<div class="line"><a id="l00594" name="l00594"></a><span class="lineno">  594</span>}</div>
</div>
<div class="line"><a id="l00595" name="l00595"></a><span class="lineno">  595</span> </div>
<div class="line"><a id="l00596" name="l00596"></a><span class="lineno">  596</span><span class="comment">//查询是否为二叉搜索树</span></div>
<div class="line"><a id="l00597" name="l00597"></a><span class="lineno">  597</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T&gt;</div>
<div class="foldopen" id="foldopen00598" data-start="{" data-end="}">
<div class="line"><a id="l00598" name="l00598"></a><span class="lineno"><a class="line" href="classmy__binary__tree.html#adb685df412bb6481f5167165312868ad">  598</a></span><span class="keywordtype">bool</span> <a class="code hl_function" href="classmy__binary__tree.html#adb685df412bb6481f5167165312868ad">my_binary_tree&lt;T&gt;::is_binary_search_tree</a>() {</div>
<div class="line"><a id="l00599" name="l00599"></a><span class="lineno">  599</span>    <span class="keywordflow">if</span> (!<span class="keyword">this</span>) {</div>
<div class="line"><a id="l00600" name="l00600"></a><span class="lineno">  600</span>        <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
<div class="line"><a id="l00601" name="l00601"></a><span class="lineno">  601</span>    }</div>
<div class="line"><a id="l00602" name="l00602"></a><span class="lineno">  602</span>    <span class="keywordflow">if</span> (<a class="code hl_variable" href="classmy__binary__tree.html#a69a6f187348e8b6219809620e784d3cf">left</a> &amp;&amp; <a class="code hl_variable" href="classmy__binary__tree.html#a69a6f187348e8b6219809620e784d3cf">left</a>-&gt;data &gt; this-&gt;data) {</div>
<div class="line"><a id="l00603" name="l00603"></a><span class="lineno">  603</span>        <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
<div class="line"><a id="l00604" name="l00604"></a><span class="lineno">  604</span>    }</div>
<div class="line"><a id="l00605" name="l00605"></a><span class="lineno">  605</span>    <span class="keywordflow">if</span> (<a class="code hl_variable" href="classmy__binary__tree.html#a8910dc810a9a95fe4dc308eeef739b6a">right</a> &amp;&amp; <a class="code hl_variable" href="classmy__binary__tree.html#a8910dc810a9a95fe4dc308eeef739b6a">right</a>-&gt;data &lt; this-&gt;data) {</div>
<div class="line"><a id="l00606" name="l00606"></a><span class="lineno">  606</span>        <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
<div class="line"><a id="l00607" name="l00607"></a><span class="lineno">  607</span>    }</div>
<div class="line"><a id="l00608" name="l00608"></a><span class="lineno">  608</span>    <span class="keywordtype">bool</span> left_bst = (<a class="code hl_variable" href="classmy__binary__tree.html#a69a6f187348e8b6219809620e784d3cf">left</a> ? <a class="code hl_variable" href="classmy__binary__tree.html#a69a6f187348e8b6219809620e784d3cf">left</a>-&gt;is_binary_search_tree() : <span class="keyword">true</span>);</div>
<div class="line"><a id="l00609" name="l00609"></a><span class="lineno">  609</span>    <span class="keywordtype">bool</span> right_bst = (<a class="code hl_variable" href="classmy__binary__tree.html#a8910dc810a9a95fe4dc308eeef739b6a">right</a> ? <a class="code hl_variable" href="classmy__binary__tree.html#a8910dc810a9a95fe4dc308eeef739b6a">right</a>-&gt;is_binary_search_tree() : <span class="keyword">true</span>);</div>
<div class="line"><a id="l00610" name="l00610"></a><span class="lineno">  610</span>    <span class="keywordflow">return</span> left_bst &amp;&amp; right_bst;</div>
<div class="line"><a id="l00611" name="l00611"></a><span class="lineno">  611</span>}</div>
</div>
<div class="line"><a id="l00612" name="l00612"></a><span class="lineno">  612</span> </div>
<div class="line"><a id="l00613" name="l00613"></a><span class="lineno">  613</span><span class="comment">//查询固定值的叶子</span></div>
<div class="line"><a id="l00614" name="l00614"></a><span class="lineno">  614</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T&gt;</div>
<div class="foldopen" id="foldopen00615" data-start="{" data-end="}">
<div class="line"><a id="l00615" name="l00615"></a><span class="lineno"><a class="line" href="classmy__binary__tree.html#a490bf7f8ebe87b6040b1294f73979fea">  615</a></span><a class="code hl_function" href="classmy__binary__tree.html#ae19ca02504d47a17836f0b0c533f8982">my_binary_tree&lt;T&gt;</a>* <a class="code hl_function" href="classmy__binary__tree.html#a490bf7f8ebe87b6040b1294f73979fea">my_binary_tree&lt;T&gt;::find</a>(<span class="keywordtype">int</span> val) {</div>
<div class="line"><a id="l00616" name="l00616"></a><span class="lineno">  616</span>    <span class="keywordflow">if</span> (<a class="code hl_function" href="classmy__binary__tree.html#a8fc393aceaa7e46fc5fb6b9377c12ea3">is_empty</a>() == <span class="keyword">true</span>) {</div>
<div class="line"><a id="l00617" name="l00617"></a><span class="lineno">  617</span>        <span class="keywordflow">return</span> NULL;</div>
<div class="line"><a id="l00618" name="l00618"></a><span class="lineno">  618</span>    }</div>
<div class="line"><a id="l00619" name="l00619"></a><span class="lineno">  619</span>    <span class="keywordflow">if</span> (<a class="code hl_variable" href="classmy__binary__tree.html#ae2d15edcaec6e5543a5e8c64ea0173cb">data</a> == val) {</div>
<div class="line"><a id="l00620" name="l00620"></a><span class="lineno">  620</span>        <span class="keywordflow">return</span> <span class="keyword">this</span>;</div>
<div class="line"><a id="l00621" name="l00621"></a><span class="lineno">  621</span>    }</div>
<div class="line"><a id="l00622" name="l00622"></a><span class="lineno">  622</span>    <a class="code hl_function" href="classmy__binary__tree.html#ae19ca02504d47a17836f0b0c533f8982">my_binary_tree&lt;T&gt;</a>* p = (<a class="code hl_variable" href="classmy__binary__tree.html#a69a6f187348e8b6219809620e784d3cf">left</a> ? <a class="code hl_variable" href="classmy__binary__tree.html#a69a6f187348e8b6219809620e784d3cf">left</a>-&gt;find(val) : NULL);</div>
<div class="line"><a id="l00623" name="l00623"></a><span class="lineno">  623</span>    <span class="keywordflow">if</span> (p != NULL) {</div>
<div class="line"><a id="l00624" name="l00624"></a><span class="lineno">  624</span>        <span class="keywordflow">return</span> p;</div>
<div class="line"><a id="l00625" name="l00625"></a><span class="lineno">  625</span>    }</div>
<div class="line"><a id="l00626" name="l00626"></a><span class="lineno">  626</span>    <a class="code hl_function" href="classmy__binary__tree.html#ae19ca02504d47a17836f0b0c533f8982">my_binary_tree&lt;T&gt;</a>* q = (<a class="code hl_variable" href="classmy__binary__tree.html#a8910dc810a9a95fe4dc308eeef739b6a">right</a> ? <a class="code hl_variable" href="classmy__binary__tree.html#a8910dc810a9a95fe4dc308eeef739b6a">right</a>-&gt;find(val) : NULL);</div>
<div class="line"><a id="l00627" name="l00627"></a><span class="lineno">  627</span>    <span class="keywordflow">if</span> (q != NULL) {</div>
<div class="line"><a id="l00628" name="l00628"></a><span class="lineno">  628</span>        <span class="keywordflow">return</span> q;</div>
<div class="line"><a id="l00629" name="l00629"></a><span class="lineno">  629</span>    }</div>
<div class="line"><a id="l00630" name="l00630"></a><span class="lineno">  630</span>    <span class="keywordflow">return</span> NULL;</div>
<div class="line"><a id="l00631" name="l00631"></a><span class="lineno">  631</span>}</div>
</div>
<div class="line"><a id="l00632" name="l00632"></a><span class="lineno">  632</span> </div>
<div class="line"><a id="l00633" name="l00633"></a><span class="lineno">  633</span><span class="comment">//查询某节点的父节点</span></div>
<div class="line"><a id="l00634" name="l00634"></a><span class="lineno">  634</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T&gt;</div>
<div class="foldopen" id="foldopen00635" data-start="{" data-end="}">
<div class="line"><a id="l00635" name="l00635"></a><span class="lineno"><a class="line" href="classmy__binary__tree.html#ad767eada19d83ada460c5eb0c2104056">  635</a></span><a class="code hl_function" href="classmy__binary__tree.html#ae19ca02504d47a17836f0b0c533f8982">my_binary_tree&lt;T&gt;</a>* <a class="code hl_function" href="classmy__binary__tree.html#ad767eada19d83ada460c5eb0c2104056">my_binary_tree&lt;T&gt;::find_father</a>(<a class="code hl_function" href="classmy__binary__tree.html#ae19ca02504d47a17836f0b0c533f8982">my_binary_tree&lt;T&gt;</a>* son) {</div>
<div class="line"><a id="l00636" name="l00636"></a><span class="lineno">  636</span>    <span class="keywordflow">if</span> (<a class="code hl_function" href="classmy__binary__tree.html#a8fc393aceaa7e46fc5fb6b9377c12ea3">is_empty</a>() == <span class="keyword">true</span>) {</div>
<div class="line"><a id="l00637" name="l00637"></a><span class="lineno">  637</span>        <span class="keywordflow">return</span> NULL;</div>
<div class="line"><a id="l00638" name="l00638"></a><span class="lineno">  638</span>    }</div>
<div class="line"><a id="l00639" name="l00639"></a><span class="lineno">  639</span>    <span class="keywordflow">if</span> (<span class="keyword">this</span> == son) {  <span class="comment">// 根节点无父节点</span></div>
<div class="line"><a id="l00640" name="l00640"></a><span class="lineno">  640</span>        <span class="keywordflow">return</span> NULL;</div>
<div class="line"><a id="l00641" name="l00641"></a><span class="lineno">  641</span>    }</div>
<div class="line"><a id="l00642" name="l00642"></a><span class="lineno">  642</span>    <span class="keywordflow">if</span> (<a class="code hl_variable" href="classmy__binary__tree.html#a69a6f187348e8b6219809620e784d3cf">left</a> == son || <a class="code hl_variable" href="classmy__binary__tree.html#a8910dc810a9a95fe4dc308eeef739b6a">right</a> == son) {</div>
<div class="line"><a id="l00643" name="l00643"></a><span class="lineno">  643</span>        <span class="keywordflow">return</span> <span class="keyword">this</span>;</div>
<div class="line"><a id="l00644" name="l00644"></a><span class="lineno">  644</span>    }</div>
<div class="line"><a id="l00645" name="l00645"></a><span class="lineno">  645</span>    <a class="code hl_function" href="classmy__binary__tree.html#ae19ca02504d47a17836f0b0c533f8982">my_binary_tree&lt;T&gt;</a>* p = (<a class="code hl_variable" href="classmy__binary__tree.html#a69a6f187348e8b6219809620e784d3cf">left</a> ? <a class="code hl_variable" href="classmy__binary__tree.html#a69a6f187348e8b6219809620e784d3cf">left</a>-&gt;find_father(son) : NULL);</div>
<div class="line"><a id="l00646" name="l00646"></a><span class="lineno">  646</span>    <span class="keywordflow">if</span> (p != NULL) {</div>
<div class="line"><a id="l00647" name="l00647"></a><span class="lineno">  647</span>        <span class="keywordflow">return</span> p;</div>
<div class="line"><a id="l00648" name="l00648"></a><span class="lineno">  648</span>    }</div>
<div class="line"><a id="l00649" name="l00649"></a><span class="lineno">  649</span>    <a class="code hl_function" href="classmy__binary__tree.html#ae19ca02504d47a17836f0b0c533f8982">my_binary_tree&lt;T&gt;</a>* q = (<a class="code hl_variable" href="classmy__binary__tree.html#a8910dc810a9a95fe4dc308eeef739b6a">right</a> ? <a class="code hl_variable" href="classmy__binary__tree.html#a8910dc810a9a95fe4dc308eeef739b6a">right</a>-&gt;find_father(son) : NULL);</div>
<div class="line"><a id="l00650" name="l00650"></a><span class="lineno">  650</span>    <span class="keywordflow">if</span> (q != NULL) {</div>
<div class="line"><a id="l00651" name="l00651"></a><span class="lineno">  651</span>        <span class="keywordflow">return</span> q;</div>
<div class="line"><a id="l00652" name="l00652"></a><span class="lineno">  652</span>    }</div>
<div class="line"><a id="l00653" name="l00653"></a><span class="lineno">  653</span>    <span class="keywordflow">return</span> NULL;</div>
<div class="line"><a id="l00654" name="l00654"></a><span class="lineno">  654</span>}</div>
</div>
<div class="line"><a id="l00655" name="l00655"></a><span class="lineno">  655</span> </div>
<div class="line"><a id="l00656" name="l00656"></a><span class="lineno">  656</span><span class="comment">//查询是否为平衡二叉树</span></div>
<div class="line"><a id="l00657" name="l00657"></a><span class="lineno">  657</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T&gt;</div>
<div class="foldopen" id="foldopen00658" data-start="{" data-end="}">
<div class="line"><a id="l00658" name="l00658"></a><span class="lineno"><a class="line" href="classmy__binary__tree.html#a35c9081b6b3dfe457c8d29697ccfdfb1">  658</a></span><span class="keywordtype">bool</span> <a class="code hl_function" href="classmy__binary__tree.html#a35c9081b6b3dfe457c8d29697ccfdfb1">my_binary_tree&lt;T&gt;::is_balence_binary_tree</a>() {</div>
<div class="line"><a id="l00659" name="l00659"></a><span class="lineno">  659</span>    <span class="keywordflow">if</span> (<a class="code hl_function" href="classmy__binary__tree.html#a8fc393aceaa7e46fc5fb6b9377c12ea3">is_empty</a>() == <span class="keyword">true</span>) {</div>
<div class="line"><a id="l00660" name="l00660"></a><span class="lineno">  660</span>        <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
<div class="line"><a id="l00661" name="l00661"></a><span class="lineno">  661</span>    }</div>
<div class="line"><a id="l00662" name="l00662"></a><span class="lineno">  662</span>    <span class="keywordtype">int</span> left_h = (<a class="code hl_variable" href="classmy__binary__tree.html#a69a6f187348e8b6219809620e784d3cf">left</a> ? <a class="code hl_variable" href="classmy__binary__tree.html#a69a6f187348e8b6219809620e784d3cf">left</a>-&gt;get_height() : 0);</div>
<div class="line"><a id="l00663" name="l00663"></a><span class="lineno">  663</span>    <span class="keywordtype">int</span> right_h = (<a class="code hl_variable" href="classmy__binary__tree.html#a8910dc810a9a95fe4dc308eeef739b6a">right</a> ? <a class="code hl_variable" href="classmy__binary__tree.html#a8910dc810a9a95fe4dc308eeef739b6a">right</a>-&gt;get_height() : 0);</div>
<div class="line"><a id="l00664" name="l00664"></a><span class="lineno">  664</span>    <span class="keywordflow">if</span> (abs(left_h - right_h) &gt; 1) {</div>
<div class="line"><a id="l00665" name="l00665"></a><span class="lineno">  665</span>        <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
<div class="line"><a id="l00666" name="l00666"></a><span class="lineno">  666</span>    }</div>
<div class="line"><a id="l00667" name="l00667"></a><span class="lineno">  667</span>    <span class="keywordflow">return</span> (<a class="code hl_variable" href="classmy__binary__tree.html#a69a6f187348e8b6219809620e784d3cf">left</a> ? <a class="code hl_variable" href="classmy__binary__tree.html#a69a6f187348e8b6219809620e784d3cf">left</a>-&gt;is_balence_binary_tree() : <span class="keyword">true</span>) &amp;&amp; </div>
<div class="line"><a id="l00668" name="l00668"></a><span class="lineno">  668</span>           (<a class="code hl_variable" href="classmy__binary__tree.html#a8910dc810a9a95fe4dc308eeef739b6a">right</a> ? <a class="code hl_variable" href="classmy__binary__tree.html#a8910dc810a9a95fe4dc308eeef739b6a">right</a>-&gt;is_balence_binary_tree() : <span class="keyword">true</span>);</div>
<div class="line"><a id="l00669" name="l00669"></a><span class="lineno">  669</span>}</div>
</div>
<div class="line"><a id="l00670" name="l00670"></a><span class="lineno">  670</span> </div>
<div class="line"><a id="l00671" name="l00671"></a><span class="lineno">  671</span><span class="comment">//----------------------------------增删相关------------------------------------</span></div>
<div class="line"><a id="l00672" name="l00672"></a><span class="lineno">  672</span><span class="comment">//指定左/右子树并追加</span></div>
<div class="line"><a id="l00673" name="l00673"></a><span class="lineno">  673</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T&gt;</div>
<div class="foldopen" id="foldopen00674" data-start="{" data-end="}">
<div class="line"><a id="l00674" name="l00674"></a><span class="lineno"><a class="line" href="classmy__binary__tree.html#aa23b0dbc0a4f4f7741111867f6d8b2e9">  674</a></span><span class="keywordtype">void</span> <a class="code hl_function" href="classmy__binary__tree.html#aa23b0dbc0a4f4f7741111867f6d8b2e9">my_binary_tree&lt;T&gt;::append</a>(<a class="code hl_function" href="classmy__binary__tree.html#ae19ca02504d47a17836f0b0c533f8982">my_binary_tree&lt;T&gt;</a>* another_tree, <span class="keywordtype">string</span> l_or_r) {</div>
<div class="line"><a id="l00675" name="l00675"></a><span class="lineno">  675</span>    <span class="keywordflow">if</span> (l_or_r == <span class="stringliteral">&quot;left&quot;</span>) {</div>
<div class="line"><a id="l00676" name="l00676"></a><span class="lineno">  676</span>        assert((<a class="code hl_variable" href="classmy__binary__tree.html#a69a6f187348e8b6219809620e784d3cf">left</a> == NULL) &amp;&amp; <span class="stringliteral">&quot;illegal: left is not NULL&quot;</span>);</div>
<div class="line"><a id="l00677" name="l00677"></a><span class="lineno">  677</span>        <a class="code hl_variable" href="classmy__binary__tree.html#a69a6f187348e8b6219809620e784d3cf">left</a> = another_tree;</div>
<div class="line"><a id="l00678" name="l00678"></a><span class="lineno">  678</span>        <span class="keywordflow">return</span>;</div>
<div class="line"><a id="l00679" name="l00679"></a><span class="lineno">  679</span>    }</div>
<div class="line"><a id="l00680" name="l00680"></a><span class="lineno">  680</span>    <span class="keywordflow">if</span> (l_or_r == <span class="stringliteral">&quot;right&quot;</span>) {</div>
<div class="line"><a id="l00681" name="l00681"></a><span class="lineno">  681</span>        assert((<a class="code hl_variable" href="classmy__binary__tree.html#a8910dc810a9a95fe4dc308eeef739b6a">right</a> == NULL) &amp;&amp; <span class="stringliteral">&quot;illegal: right is not NULL&quot;</span>);</div>
<div class="line"><a id="l00682" name="l00682"></a><span class="lineno">  682</span>        <a class="code hl_variable" href="classmy__binary__tree.html#a8910dc810a9a95fe4dc308eeef739b6a">right</a> = another_tree;</div>
<div class="line"><a id="l00683" name="l00683"></a><span class="lineno">  683</span>        <span class="keywordflow">return</span>;</div>
<div class="line"><a id="l00684" name="l00684"></a><span class="lineno">  684</span>    }</div>
<div class="line"><a id="l00685" name="l00685"></a><span class="lineno">  685</span>}</div>
</div>
<div class="line"><a id="l00686" name="l00686"></a><span class="lineno">  686</span> </div>
<div class="line"><a id="l00687" name="l00687"></a><span class="lineno">  687</span><span class="comment">//复制树</span></div>
<div class="line"><a id="l00688" name="l00688"></a><span class="lineno">  688</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T&gt;</div>
<div class="foldopen" id="foldopen00689" data-start="{" data-end="}">
<div class="line"><a id="l00689" name="l00689"></a><span class="lineno"><a class="line" href="classmy__binary__tree.html#a19f020b91ef749755745ac08d69be0b6">  689</a></span><span class="keywordtype">void</span> <a class="code hl_function" href="classmy__binary__tree.html#a19f020b91ef749755745ac08d69be0b6">my_binary_tree&lt;T&gt;::copy</a>(<a class="code hl_function" href="classmy__binary__tree.html#ae19ca02504d47a17836f0b0c533f8982">my_binary_tree&lt;T&gt;</a>* des, <a class="code hl_function" href="classmy__binary__tree.html#ae19ca02504d47a17836f0b0c533f8982">my_binary_tree&lt;T&gt;</a>* src) {</div>
<div class="line"><a id="l00690" name="l00690"></a><span class="lineno">  690</span>    des-&gt;<a class="code hl_variable" href="classmy__binary__tree.html#ae2d15edcaec6e5543a5e8c64ea0173cb">data</a> = src-&gt;<a class="code hl_variable" href="classmy__binary__tree.html#ae2d15edcaec6e5543a5e8c64ea0173cb">data</a>;</div>
<div class="line"><a id="l00691" name="l00691"></a><span class="lineno">  691</span>    des-&gt;<a class="code hl_variable" href="classmy__binary__tree.html#a69a6f187348e8b6219809620e784d3cf">left</a> = src-&gt;<a class="code hl_variable" href="classmy__binary__tree.html#a69a6f187348e8b6219809620e784d3cf">left</a>;</div>
<div class="line"><a id="l00692" name="l00692"></a><span class="lineno">  692</span>    des-&gt;<a class="code hl_variable" href="classmy__binary__tree.html#a8910dc810a9a95fe4dc308eeef739b6a">right</a> = src-&gt;<a class="code hl_variable" href="classmy__binary__tree.html#a8910dc810a9a95fe4dc308eeef739b6a">right</a>;</div>
<div class="line"><a id="l00693" name="l00693"></a><span class="lineno">  693</span>}</div>
</div>
<div class="line"><a id="l00694" name="l00694"></a><span class="lineno">  694</span> </div>
<div class="line"><a id="l00695" name="l00695"></a><span class="lineno">  695</span><span class="comment">//插入节点</span></div>
<div class="line"><a id="l00696" name="l00696"></a><span class="lineno">  696</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T&gt;</div>
<div class="foldopen" id="foldopen00697" data-start="{" data-end="}">
<div class="line"><a id="l00697" name="l00697"></a><span class="lineno"><a class="line" href="classmy__binary__tree.html#a9675071237ce43751138c4fa3ef43657">  697</a></span><span class="keywordtype">void</span> <a class="code hl_function" href="classmy__binary__tree.html#a9675071237ce43751138c4fa3ef43657">my_binary_tree&lt;T&gt;::insert</a>(T val, <span class="keywordtype">string</span> position) {</div>
<div class="line"><a id="l00698" name="l00698"></a><span class="lineno">  698</span>    <span class="keywordtype">int</span> <span class="keywordtype">size_t</span>=position.size();</div>
<div class="line"><a id="l00699" name="l00699"></a><span class="lineno">  699</span>    <span class="keywordtype">int</span> i=0;</div>
<div class="line"><a id="l00700" name="l00700"></a><span class="lineno">  700</span>    <span class="keywordtype">int</span> height=<a class="code hl_function" href="classmy__binary__tree.html#a047c1a5b1fb76a0cb62700eb1c53bb8b">get_height</a>();</div>
<div class="line"><a id="l00701" name="l00701"></a><span class="lineno">  701</span>    T value=0;</div>
<div class="line"><a id="l00702" name="l00702"></a><span class="lineno">  702</span>    <a class="code hl_function" href="classmy__binary__tree.html#ae19ca02504d47a17836f0b0c533f8982">my_binary_tree&lt;T&gt;</a>* p=<span class="keyword">this</span>;</div>
<div class="line"><a id="l00703" name="l00703"></a><span class="lineno">  703</span>    <span class="keywordflow">while</span>(i&lt;height-1&amp;&amp;i&lt;<span class="keywordtype">size_t</span>-1){</div>
<div class="line"><a id="l00704" name="l00704"></a><span class="lineno">  704</span>        <span class="keywordflow">if</span>(position[i]==<span class="charliteral">&#39;1&#39;</span>){</div>
<div class="line"><a id="l00705" name="l00705"></a><span class="lineno">  705</span>            p=p-&gt;<a class="code hl_variable" href="classmy__binary__tree.html#a69a6f187348e8b6219809620e784d3cf">left</a>;</div>
<div class="line"><a id="l00706" name="l00706"></a><span class="lineno">  706</span>        }</div>
<div class="line"><a id="l00707" name="l00707"></a><span class="lineno">  707</span>        <span class="keywordflow">if</span>(position[i]==<span class="charliteral">&#39;0&#39;</span>){</div>
<div class="line"><a id="l00708" name="l00708"></a><span class="lineno">  708</span>            p=p-&gt;<a class="code hl_variable" href="classmy__binary__tree.html#a8910dc810a9a95fe4dc308eeef739b6a">right</a>;</div>
<div class="line"><a id="l00709" name="l00709"></a><span class="lineno">  709</span>        }</div>
<div class="line"><a id="l00710" name="l00710"></a><span class="lineno">  710</span>        i++;</div>
<div class="line"><a id="l00711" name="l00711"></a><span class="lineno">  711</span>    }</div>
<div class="line"><a id="l00712" name="l00712"></a><span class="lineno">  712</span>    <span class="keywordflow">if</span>(position[i]==<span class="charliteral">&#39;1&#39;</span>){</div>
<div class="line"><a id="l00713" name="l00713"></a><span class="lineno">  713</span>        assert((p-&gt;<a class="code hl_variable" href="classmy__binary__tree.html#a69a6f187348e8b6219809620e784d3cf">left</a>==NULL)&amp;&amp;<span class="stringliteral">&quot;can&#39;t insert at an existed space!&#39;&quot;</span>);</div>
<div class="line"><a id="l00714" name="l00714"></a><span class="lineno">  714</span>        p-&gt;<a class="code hl_variable" href="classmy__binary__tree.html#a69a6f187348e8b6219809620e784d3cf">left</a>=<span class="keyword">new</span> <a class="code hl_function" href="classmy__binary__tree.html#ae19ca02504d47a17836f0b0c533f8982">my_binary_tree&lt;T&gt;</a>(val);            </div>
<div class="line"><a id="l00715" name="l00715"></a><span class="lineno">  715</span>    }</div>
<div class="line"><a id="l00716" name="l00716"></a><span class="lineno">  716</span>    <span class="keywordflow">if</span>(position[i]==<span class="charliteral">&#39;0&#39;</span>){</div>
<div class="line"><a id="l00717" name="l00717"></a><span class="lineno">  717</span>        assert((p-&gt;<a class="code hl_variable" href="classmy__binary__tree.html#a8910dc810a9a95fe4dc308eeef739b6a">right</a>==NULL)&amp;&amp;<span class="stringliteral">&quot;can&#39;t insert at an existed space!&#39;&quot;</span>);</div>
<div class="line"><a id="l00718" name="l00718"></a><span class="lineno">  718</span>        p-&gt;<a class="code hl_variable" href="classmy__binary__tree.html#a8910dc810a9a95fe4dc308eeef739b6a">right</a>=<span class="keyword">new</span> <a class="code hl_function" href="classmy__binary__tree.html#ae19ca02504d47a17836f0b0c533f8982">my_binary_tree&lt;T&gt;</a>(val);</div>
<div class="line"><a id="l00719" name="l00719"></a><span class="lineno">  719</span>    }</div>
<div class="line"><a id="l00720" name="l00720"></a><span class="lineno">  720</span>}</div>
</div>
<div class="line"><a id="l00721" name="l00721"></a><span class="lineno">  721</span> </div>
<div class="line"><a id="l00722" name="l00722"></a><span class="lineno">  722</span><span class="comment">//删除节点</span></div>
<div class="line"><a id="l00723" name="l00723"></a><span class="lineno">  723</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T&gt;</div>
<div class="foldopen" id="foldopen00724" data-start="{" data-end="}">
<div class="line"><a id="l00724" name="l00724"></a><span class="lineno"><a class="line" href="classmy__binary__tree.html#a24a14198a85ebfd603f5284ef9940e41">  724</a></span><span class="keywordtype">void</span> <a class="code hl_function" href="classmy__binary__tree.html#a24a14198a85ebfd603f5284ef9940e41">my_binary_tree&lt;T&gt;::delete_point</a>(<a class="code hl_function" href="classmy__binary__tree.html#ae19ca02504d47a17836f0b0c533f8982">my_binary_tree&lt;T&gt;</a>* point) {</div>
<div class="line"><a id="l00725" name="l00725"></a><span class="lineno">  725</span>    <a class="code hl_function" href="classmy__binary__tree.html#ae19ca02504d47a17836f0b0c533f8982">my_binary_tree&lt;T&gt;</a>* p=<a class="code hl_function" href="classmy__binary__tree.html#ad767eada19d83ada460c5eb0c2104056">find_father</a>(point);</div>
<div class="line"><a id="l00726" name="l00726"></a><span class="lineno">  726</span>    <span class="keywordflow">if</span>(p){</div>
<div class="line"><a id="l00727" name="l00727"></a><span class="lineno">  727</span>        <span class="keywordflow">if</span>(p-&gt;<a class="code hl_variable" href="classmy__binary__tree.html#a69a6f187348e8b6219809620e784d3cf">left</a>&amp;&amp;p-&gt;<a class="code hl_variable" href="classmy__binary__tree.html#a69a6f187348e8b6219809620e784d3cf">left</a>==point){</div>
<div class="line"><a id="l00728" name="l00728"></a><span class="lineno">  728</span>            p-&gt;<a class="code hl_variable" href="classmy__binary__tree.html#a69a6f187348e8b6219809620e784d3cf">left</a>=NULL;</div>
<div class="line"><a id="l00729" name="l00729"></a><span class="lineno">  729</span>            <span class="keywordflow">return</span>;</div>
<div class="line"><a id="l00730" name="l00730"></a><span class="lineno">  730</span>        }   </div>
<div class="line"><a id="l00731" name="l00731"></a><span class="lineno">  731</span>        <span class="keywordflow">if</span>(p-&gt;<a class="code hl_variable" href="classmy__binary__tree.html#a8910dc810a9a95fe4dc308eeef739b6a">right</a>&amp;&amp;p-&gt;<a class="code hl_variable" href="classmy__binary__tree.html#a8910dc810a9a95fe4dc308eeef739b6a">right</a>==point){</div>
<div class="line"><a id="l00732" name="l00732"></a><span class="lineno">  732</span>            p-&gt;<a class="code hl_variable" href="classmy__binary__tree.html#a8910dc810a9a95fe4dc308eeef739b6a">right</a>=NULL;</div>
<div class="line"><a id="l00733" name="l00733"></a><span class="lineno">  733</span>            <span class="keywordflow">return</span>;</div>
<div class="line"><a id="l00734" name="l00734"></a><span class="lineno">  734</span>        }   </div>
<div class="line"><a id="l00735" name="l00735"></a><span class="lineno">  735</span>    }</div>
<div class="line"><a id="l00736" name="l00736"></a><span class="lineno">  736</span>    </div>
<div class="line"><a id="l00737" name="l00737"></a><span class="lineno">  737</span>}</div>
</div>
<div class="line"><a id="l00738" name="l00738"></a><span class="lineno">  738</span> </div>
<div class="line"><a id="l00739" name="l00739"></a><span class="lineno">  739</span><span class="comment">//删除节点</span></div>
<div class="line"><a id="l00740" name="l00740"></a><span class="lineno">  740</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T&gt;</div>
<div class="foldopen" id="foldopen00741" data-start="{" data-end="}">
<div class="line"><a id="l00741" name="l00741"></a><span class="lineno"><a class="line" href="classmy__binary__tree.html#a5fe4fbbeb0729ef67cc258d2a5350860">  741</a></span><span class="keywordtype">void</span> <a class="code hl_function" href="classmy__binary__tree.html#a5fe4fbbeb0729ef67cc258d2a5350860">my_binary_tree&lt;T&gt;::delete_pos</a>(<span class="keywordtype">string</span> position) {</div>
<div class="line"><a id="l00742" name="l00742"></a><span class="lineno">  742</span>    <span class="keywordtype">int</span> <span class="keywordtype">size_t</span>=position.size();</div>
<div class="line"><a id="l00743" name="l00743"></a><span class="lineno">  743</span>    <span class="keywordtype">int</span> i=0;</div>
<div class="line"><a id="l00744" name="l00744"></a><span class="lineno">  744</span>    <span class="keywordtype">int</span> height=<a class="code hl_function" href="classmy__binary__tree.html#a047c1a5b1fb76a0cb62700eb1c53bb8b">get_height</a>();</div>
<div class="line"><a id="l00745" name="l00745"></a><span class="lineno">  745</span>    T value=0;</div>
<div class="line"><a id="l00746" name="l00746"></a><span class="lineno">  746</span>    <a class="code hl_function" href="classmy__binary__tree.html#ae19ca02504d47a17836f0b0c533f8982">my_binary_tree&lt;T&gt;</a>* p=<span class="keyword">this</span>;</div>
<div class="line"><a id="l00747" name="l00747"></a><span class="lineno">  747</span>    <span class="keywordflow">while</span>(i&lt;height-1&amp;&amp;i&lt;<span class="keywordtype">size_t</span>){</div>
<div class="line"><a id="l00748" name="l00748"></a><span class="lineno">  748</span>        <span class="keywordflow">if</span>(position[i]==<span class="charliteral">&#39;1&#39;</span>){</div>
<div class="line"><a id="l00749" name="l00749"></a><span class="lineno">  749</span>            p=p-&gt;<a class="code hl_variable" href="classmy__binary__tree.html#a69a6f187348e8b6219809620e784d3cf">left</a>;</div>
<div class="line"><a id="l00750" name="l00750"></a><span class="lineno">  750</span>        }</div>
<div class="line"><a id="l00751" name="l00751"></a><span class="lineno">  751</span>        <span class="keywordflow">if</span>(position[i]==<span class="charliteral">&#39;0&#39;</span>){</div>
<div class="line"><a id="l00752" name="l00752"></a><span class="lineno">  752</span>            p=p-&gt;<a class="code hl_variable" href="classmy__binary__tree.html#a8910dc810a9a95fe4dc308eeef739b6a">right</a>;</div>
<div class="line"><a id="l00753" name="l00753"></a><span class="lineno">  753</span>        }</div>
<div class="line"><a id="l00754" name="l00754"></a><span class="lineno">  754</span>        i++;</div>
<div class="line"><a id="l00755" name="l00755"></a><span class="lineno">  755</span>    }</div>
<div class="line"><a id="l00756" name="l00756"></a><span class="lineno">  756</span>    <a class="code hl_function" href="classmy__binary__tree.html#a24a14198a85ebfd603f5284ef9940e41">delete_point</a>(p);</div>
<div class="line"><a id="l00757" name="l00757"></a><span class="lineno">  757</span>}</div>
</div>
<div class="line"><a id="l00758" name="l00758"></a><span class="lineno">  758</span> </div>
<div class="line"><a id="l00759" name="l00759"></a><span class="lineno">  759</span><span class="comment">//旋转二叉树，默认针对根 </span></div>
<div class="line"><a id="l00760" name="l00760"></a><span class="lineno">  760</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T&gt;</div>
<div class="foldopen" id="foldopen00761" data-start="{" data-end="}">
<div class="line"><a id="l00761" name="l00761"></a><span class="lineno"><a class="line" href="classmy__binary__tree.html#a5842011f1564adb291d8a62f1f7e7625">  761</a></span><a class="code hl_function" href="classmy__binary__tree.html#ae19ca02504d47a17836f0b0c533f8982">my_binary_tree&lt;T&gt;</a>* <a class="code hl_function" href="classmy__binary__tree.html#a5842011f1564adb291d8a62f1f7e7625">my_binary_tree&lt;T&gt;::revolve</a>(<span class="keywordtype">string</span> mode) {</div>
<div class="line"><a id="l00762" name="l00762"></a><span class="lineno">  762</span>    <span class="keywordflow">if</span>(mode==<span class="stringliteral">&quot;LL&quot;</span>){</div>
<div class="line"><a id="l00763" name="l00763"></a><span class="lineno">  763</span>        <span class="comment">//right成为根，根成为right的left，right的left成为根的right </span></div>
<div class="line"><a id="l00764" name="l00764"></a><span class="lineno">  764</span>        <span class="comment">//      A</span></div>
<div class="line"><a id="l00765" name="l00765"></a><span class="lineno">  765</span>        <span class="comment">//  B       C</span></div>
<div class="line"><a id="l00766" name="l00766"></a><span class="lineno">  766</span>        <span class="comment">//        D    E</span></div>
<div class="line"><a id="l00767" name="l00767"></a><span class="lineno">  767</span>        <span class="comment">//B&lt;A&lt;D&lt;C&lt;E</span></div>
<div class="line"><a id="l00768" name="l00768"></a><span class="lineno">  768</span>        <span class="comment">//      C</span></div>
<div class="line"><a id="l00769" name="l00769"></a><span class="lineno">  769</span>        <span class="comment">//  A       E</span></div>
<div class="line"><a id="l00770" name="l00770"></a><span class="lineno">  770</span>        <span class="comment">//B   D</span></div>
<div class="line"><a id="l00771" name="l00771"></a><span class="lineno">  771</span>        <a class="code hl_function" href="classmy__binary__tree.html#ae19ca02504d47a17836f0b0c533f8982">my_binary_tree&lt;T&gt;</a>* return_tree=(<a class="code hl_function" href="classmy__binary__tree.html#ae19ca02504d47a17836f0b0c533f8982">my_binary_tree&lt;T&gt;</a>*)malloc(<span class="keyword">sizeof</span>(<a class="code hl_function" href="classmy__binary__tree.html#ae19ca02504d47a17836f0b0c533f8982">my_binary_tree&lt;T&gt;</a>));</div>
<div class="line"><a id="l00772" name="l00772"></a><span class="lineno">  772</span>        <a class="code hl_function" href="classmy__binary__tree.html#ae19ca02504d47a17836f0b0c533f8982">my_binary_tree&lt;T&gt;</a>* return_tree1=(<a class="code hl_function" href="classmy__binary__tree.html#ae19ca02504d47a17836f0b0c533f8982">my_binary_tree&lt;T&gt;</a>*)malloc(<span class="keyword">sizeof</span>(<a class="code hl_function" href="classmy__binary__tree.html#ae19ca02504d47a17836f0b0c533f8982">my_binary_tree&lt;T&gt;</a>));</div>
<div class="line"><a id="l00773" name="l00773"></a><span class="lineno">  773</span>        <a class="code hl_function" href="classmy__binary__tree.html#ae19ca02504d47a17836f0b0c533f8982">my_binary_tree&lt;T&gt;</a>* return_tree2=(<a class="code hl_function" href="classmy__binary__tree.html#ae19ca02504d47a17836f0b0c533f8982">my_binary_tree&lt;T&gt;</a>*)malloc(<span class="keyword">sizeof</span>(<a class="code hl_function" href="classmy__binary__tree.html#ae19ca02504d47a17836f0b0c533f8982">my_binary_tree&lt;T&gt;</a>));</div>
<div class="line"><a id="l00774" name="l00774"></a><span class="lineno">  774</span>        </div>
<div class="line"><a id="l00775" name="l00775"></a><span class="lineno">  775</span>        return_tree2=<a class="code hl_variable" href="classmy__binary__tree.html#a8910dc810a9a95fe4dc308eeef739b6a">right</a>-&gt;right;</div>
<div class="line"><a id="l00776" name="l00776"></a><span class="lineno">  776</span>        return_tree1-&gt;<a class="code hl_variable" href="classmy__binary__tree.html#ae2d15edcaec6e5543a5e8c64ea0173cb">data</a>=<a class="code hl_variable" href="classmy__binary__tree.html#ae2d15edcaec6e5543a5e8c64ea0173cb">data</a>;</div>
<div class="line"><a id="l00777" name="l00777"></a><span class="lineno">  777</span>        return_tree1-&gt;<a class="code hl_variable" href="classmy__binary__tree.html#a69a6f187348e8b6219809620e784d3cf">left</a>=<a class="code hl_variable" href="classmy__binary__tree.html#a69a6f187348e8b6219809620e784d3cf">left</a>;</div>
<div class="line"><a id="l00778" name="l00778"></a><span class="lineno">  778</span>        return_tree1-&gt;<a class="code hl_variable" href="classmy__binary__tree.html#a8910dc810a9a95fe4dc308eeef739b6a">right</a>=<a class="code hl_variable" href="classmy__binary__tree.html#a8910dc810a9a95fe4dc308eeef739b6a">right</a>-&gt;left;</div>
<div class="line"><a id="l00779" name="l00779"></a><span class="lineno">  779</span>        </div>
<div class="line"><a id="l00780" name="l00780"></a><span class="lineno">  780</span>        return_tree-&gt;<a class="code hl_variable" href="classmy__binary__tree.html#ae2d15edcaec6e5543a5e8c64ea0173cb">data</a>=<a class="code hl_variable" href="classmy__binary__tree.html#a8910dc810a9a95fe4dc308eeef739b6a">right</a>-&gt;data;</div>
<div class="line"><a id="l00781" name="l00781"></a><span class="lineno">  781</span>        return_tree-&gt;<a class="code hl_variable" href="classmy__binary__tree.html#a69a6f187348e8b6219809620e784d3cf">left</a>=return_tree1;</div>
<div class="line"><a id="l00782" name="l00782"></a><span class="lineno">  782</span>        return_tree-&gt;<a class="code hl_variable" href="classmy__binary__tree.html#a8910dc810a9a95fe4dc308eeef739b6a">right</a>=return_tree2;</div>
<div class="line"><a id="l00783" name="l00783"></a><span class="lineno">  783</span>        </div>
<div class="line"><a id="l00784" name="l00784"></a><span class="lineno">  784</span>        <span class="keywordflow">return</span> return_tree;     </div>
<div class="line"><a id="l00785" name="l00785"></a><span class="lineno">  785</span>    </div>
<div class="line"><a id="l00786" name="l00786"></a><span class="lineno">  786</span>    }</div>
<div class="line"><a id="l00787" name="l00787"></a><span class="lineno">  787</span>    <span class="keywordflow">if</span>(mode==<span class="stringliteral">&quot;RR&quot;</span>){</div>
<div class="line"><a id="l00788" name="l00788"></a><span class="lineno">  788</span>        <span class="comment">//left成为根，根成为left的right，left的right成为根的left</span></div>
<div class="line"><a id="l00789" name="l00789"></a><span class="lineno">  789</span>        <span class="comment">//      A</span></div>
<div class="line"><a id="l00790" name="l00790"></a><span class="lineno">  790</span>        <span class="comment">//  B       E</span></div>
<div class="line"><a id="l00791" name="l00791"></a><span class="lineno">  791</span>        <span class="comment">//C   D</span></div>
<div class="line"><a id="l00792" name="l00792"></a><span class="lineno">  792</span>        <span class="comment">//C&lt;B&lt;D&lt;A&lt;E</span></div>
<div class="line"><a id="l00793" name="l00793"></a><span class="lineno">  793</span>        <span class="comment">//      B</span></div>
<div class="line"><a id="l00794" name="l00794"></a><span class="lineno">  794</span>        <span class="comment">//  C       A</span></div>
<div class="line"><a id="l00795" name="l00795"></a><span class="lineno">  795</span>        <span class="comment">//        D   E</span></div>
<div class="line"><a id="l00796" name="l00796"></a><span class="lineno">  796</span>        <a class="code hl_function" href="classmy__binary__tree.html#ae19ca02504d47a17836f0b0c533f8982">my_binary_tree&lt;T&gt;</a>* return_tree=(<a class="code hl_function" href="classmy__binary__tree.html#ae19ca02504d47a17836f0b0c533f8982">my_binary_tree&lt;T&gt;</a>*)malloc(<span class="keyword">sizeof</span>(<a class="code hl_function" href="classmy__binary__tree.html#ae19ca02504d47a17836f0b0c533f8982">my_binary_tree&lt;T&gt;</a>));</div>
<div class="line"><a id="l00797" name="l00797"></a><span class="lineno">  797</span>        <a class="code hl_function" href="classmy__binary__tree.html#ae19ca02504d47a17836f0b0c533f8982">my_binary_tree&lt;T&gt;</a>* return_tree1=(<a class="code hl_function" href="classmy__binary__tree.html#ae19ca02504d47a17836f0b0c533f8982">my_binary_tree&lt;T&gt;</a>*)malloc(<span class="keyword">sizeof</span>(<a class="code hl_function" href="classmy__binary__tree.html#ae19ca02504d47a17836f0b0c533f8982">my_binary_tree&lt;T&gt;</a>));</div>
<div class="line"><a id="l00798" name="l00798"></a><span class="lineno">  798</span>        <a class="code hl_function" href="classmy__binary__tree.html#ae19ca02504d47a17836f0b0c533f8982">my_binary_tree&lt;T&gt;</a>* return_tree2=(<a class="code hl_function" href="classmy__binary__tree.html#ae19ca02504d47a17836f0b0c533f8982">my_binary_tree&lt;T&gt;</a>*)malloc(<span class="keyword">sizeof</span>(<a class="code hl_function" href="classmy__binary__tree.html#ae19ca02504d47a17836f0b0c533f8982">my_binary_tree&lt;T&gt;</a>));</div>
<div class="line"><a id="l00799" name="l00799"></a><span class="lineno">  799</span>        </div>
<div class="line"><a id="l00800" name="l00800"></a><span class="lineno">  800</span>        return_tree1=<a class="code hl_variable" href="classmy__binary__tree.html#a69a6f187348e8b6219809620e784d3cf">left</a>-&gt;left;</div>
<div class="line"><a id="l00801" name="l00801"></a><span class="lineno">  801</span>        return_tree2-&gt;<a class="code hl_variable" href="classmy__binary__tree.html#ae2d15edcaec6e5543a5e8c64ea0173cb">data</a>=<a class="code hl_variable" href="classmy__binary__tree.html#ae2d15edcaec6e5543a5e8c64ea0173cb">data</a>;</div>
<div class="line"><a id="l00802" name="l00802"></a><span class="lineno">  802</span>        return_tree2-&gt;<a class="code hl_variable" href="classmy__binary__tree.html#a69a6f187348e8b6219809620e784d3cf">left</a>=<a class="code hl_variable" href="classmy__binary__tree.html#a69a6f187348e8b6219809620e784d3cf">left</a>-&gt;right;</div>
<div class="line"><a id="l00803" name="l00803"></a><span class="lineno">  803</span>        return_tree2-&gt;<a class="code hl_variable" href="classmy__binary__tree.html#a8910dc810a9a95fe4dc308eeef739b6a">right</a>=<a class="code hl_variable" href="classmy__binary__tree.html#a8910dc810a9a95fe4dc308eeef739b6a">right</a>;</div>
<div class="line"><a id="l00804" name="l00804"></a><span class="lineno">  804</span>        </div>
<div class="line"><a id="l00805" name="l00805"></a><span class="lineno">  805</span>        return_tree-&gt;<a class="code hl_variable" href="classmy__binary__tree.html#ae2d15edcaec6e5543a5e8c64ea0173cb">data</a>=<a class="code hl_variable" href="classmy__binary__tree.html#a69a6f187348e8b6219809620e784d3cf">left</a>-&gt;data;</div>
<div class="line"><a id="l00806" name="l00806"></a><span class="lineno">  806</span>        return_tree-&gt;<a class="code hl_variable" href="classmy__binary__tree.html#a69a6f187348e8b6219809620e784d3cf">left</a>=return_tree1;</div>
<div class="line"><a id="l00807" name="l00807"></a><span class="lineno">  807</span>        return_tree-&gt;<a class="code hl_variable" href="classmy__binary__tree.html#a8910dc810a9a95fe4dc308eeef739b6a">right</a>=return_tree2;</div>
<div class="line"><a id="l00808" name="l00808"></a><span class="lineno">  808</span>        </div>
<div class="line"><a id="l00809" name="l00809"></a><span class="lineno">  809</span>        <span class="keywordflow">return</span> return_tree;     </div>
<div class="line"><a id="l00810" name="l00810"></a><span class="lineno">  810</span>    }</div>
<div class="line"><a id="l00811" name="l00811"></a><span class="lineno">  811</span>    <span class="keywordflow">if</span>(mode==<span class="stringliteral">&quot;LR&quot;</span>){</div>
<div class="line"><a id="l00812" name="l00812"></a><span class="lineno">  812</span>        <span class="comment">//      A</span></div>
<div class="line"><a id="l00813" name="l00813"></a><span class="lineno">  813</span>        <span class="comment">//    B     C</span></div>
<div class="line"><a id="l00814" name="l00814"></a><span class="lineno">  814</span>        <span class="comment">//  D   E</span></div>
<div class="line"><a id="l00815" name="l00815"></a><span class="lineno">  815</span>        <span class="comment">//     H  I</span></div>
<div class="line"><a id="l00816" name="l00816"></a><span class="lineno">  816</span>        <span class="comment">//D&lt;B&lt;H&lt;E&lt;I&lt;A&lt;C</span></div>
<div class="line"><a id="l00817" name="l00817"></a><span class="lineno">  817</span>        <span class="comment">//    E</span></div>
<div class="line"><a id="l00818" name="l00818"></a><span class="lineno">  818</span>        <span class="comment">//  B   A</span></div>
<div class="line"><a id="l00819" name="l00819"></a><span class="lineno">  819</span>        <span class="comment">//D  H I  C</span></div>
<div class="line"><a id="l00820" name="l00820"></a><span class="lineno">  820</span>        <a class="code hl_function" href="classmy__binary__tree.html#ae19ca02504d47a17836f0b0c533f8982">my_binary_tree&lt;T&gt;</a>* return_tree=(<a class="code hl_function" href="classmy__binary__tree.html#ae19ca02504d47a17836f0b0c533f8982">my_binary_tree&lt;T&gt;</a>*)malloc(<span class="keyword">sizeof</span>(<a class="code hl_function" href="classmy__binary__tree.html#ae19ca02504d47a17836f0b0c533f8982">my_binary_tree&lt;T&gt;</a>));</div>
<div class="line"><a id="l00821" name="l00821"></a><span class="lineno">  821</span>        <a class="code hl_function" href="classmy__binary__tree.html#ae19ca02504d47a17836f0b0c533f8982">my_binary_tree&lt;T&gt;</a>* return_tree1=(<a class="code hl_function" href="classmy__binary__tree.html#ae19ca02504d47a17836f0b0c533f8982">my_binary_tree&lt;T&gt;</a>*)malloc(<span class="keyword">sizeof</span>(<a class="code hl_function" href="classmy__binary__tree.html#ae19ca02504d47a17836f0b0c533f8982">my_binary_tree&lt;T&gt;</a>));</div>
<div class="line"><a id="l00822" name="l00822"></a><span class="lineno">  822</span>        <a class="code hl_function" href="classmy__binary__tree.html#ae19ca02504d47a17836f0b0c533f8982">my_binary_tree&lt;T&gt;</a>* return_tree2=(<a class="code hl_function" href="classmy__binary__tree.html#ae19ca02504d47a17836f0b0c533f8982">my_binary_tree&lt;T&gt;</a>*)malloc(<span class="keyword">sizeof</span>(<a class="code hl_function" href="classmy__binary__tree.html#ae19ca02504d47a17836f0b0c533f8982">my_binary_tree&lt;T&gt;</a>));</div>
<div class="line"><a id="l00823" name="l00823"></a><span class="lineno">  823</span>        </div>
<div class="line"><a id="l00824" name="l00824"></a><span class="lineno">  824</span>        return_tree1=<a class="code hl_variable" href="classmy__binary__tree.html#a69a6f187348e8b6219809620e784d3cf">left</a>;</div>
<div class="line"><a id="l00825" name="l00825"></a><span class="lineno">  825</span>        return_tree1-&gt;<a class="code hl_variable" href="classmy__binary__tree.html#a8910dc810a9a95fe4dc308eeef739b6a">right</a>=<a class="code hl_variable" href="classmy__binary__tree.html#a69a6f187348e8b6219809620e784d3cf">left</a>-&gt;right-&gt;left;</div>
<div class="line"><a id="l00826" name="l00826"></a><span class="lineno">  826</span>        return_tree2=<span class="keyword">this</span>;</div>
<div class="line"><a id="l00827" name="l00827"></a><span class="lineno">  827</span>        return_tree2-&gt;<a class="code hl_variable" href="classmy__binary__tree.html#a69a6f187348e8b6219809620e784d3cf">left</a>=<a class="code hl_variable" href="classmy__binary__tree.html#a69a6f187348e8b6219809620e784d3cf">left</a>-&gt;right-&gt;right;</div>
<div class="line"><a id="l00828" name="l00828"></a><span class="lineno">  828</span>        </div>
<div class="line"><a id="l00829" name="l00829"></a><span class="lineno">  829</span>        return_tree-&gt;<a class="code hl_variable" href="classmy__binary__tree.html#ae2d15edcaec6e5543a5e8c64ea0173cb">data</a>=<a class="code hl_variable" href="classmy__binary__tree.html#a69a6f187348e8b6219809620e784d3cf">left</a>-&gt;right-&gt;data;</div>
<div class="line"><a id="l00830" name="l00830"></a><span class="lineno">  830</span>        return_tree-&gt;<a class="code hl_variable" href="classmy__binary__tree.html#a69a6f187348e8b6219809620e784d3cf">left</a>=return_tree1;</div>
<div class="line"><a id="l00831" name="l00831"></a><span class="lineno">  831</span>        return_tree-&gt;<a class="code hl_variable" href="classmy__binary__tree.html#a8910dc810a9a95fe4dc308eeef739b6a">right</a>=return_tree2;</div>
<div class="line"><a id="l00832" name="l00832"></a><span class="lineno">  832</span>        </div>
<div class="line"><a id="l00833" name="l00833"></a><span class="lineno">  833</span>        <span class="keywordflow">return</span> return_tree;     </div>
<div class="line"><a id="l00834" name="l00834"></a><span class="lineno">  834</span>    }</div>
<div class="line"><a id="l00835" name="l00835"></a><span class="lineno">  835</span>    <span class="keywordflow">if</span>(mode==<span class="stringliteral">&quot;RL&quot;</span>){</div>
<div class="line"><a id="l00836" name="l00836"></a><span class="lineno">  836</span>        <span class="comment">//      A</span></div>
<div class="line"><a id="l00837" name="l00837"></a><span class="lineno">  837</span>        <span class="comment">//  B       C</span></div>
<div class="line"><a id="l00838" name="l00838"></a><span class="lineno">  838</span>        <span class="comment">//        D   E</span></div>
<div class="line"><a id="l00839" name="l00839"></a><span class="lineno">  839</span>        <span class="comment">//      F  G</span></div>
<div class="line"><a id="l00840" name="l00840"></a><span class="lineno">  840</span>        <span class="comment">//B&lt;A&lt;D&lt;C&lt;E</span></div>
<div class="line"><a id="l00841" name="l00841"></a><span class="lineno">  841</span>        <span class="comment">//      D</span></div>
<div class="line"><a id="l00842" name="l00842"></a><span class="lineno">  842</span>        <span class="comment">//  A      C</span></div>
<div class="line"><a id="l00843" name="l00843"></a><span class="lineno">  843</span>        <span class="comment">//B   F    G   E</span></div>
<div class="line"><a id="l00844" name="l00844"></a><span class="lineno">  844</span>        <a class="code hl_function" href="classmy__binary__tree.html#ae19ca02504d47a17836f0b0c533f8982">my_binary_tree&lt;T&gt;</a>* return_tree=(<a class="code hl_function" href="classmy__binary__tree.html#ae19ca02504d47a17836f0b0c533f8982">my_binary_tree&lt;T&gt;</a>*)malloc(<span class="keyword">sizeof</span>(<a class="code hl_function" href="classmy__binary__tree.html#ae19ca02504d47a17836f0b0c533f8982">my_binary_tree&lt;T&gt;</a>));</div>
<div class="line"><a id="l00845" name="l00845"></a><span class="lineno">  845</span>        <a class="code hl_function" href="classmy__binary__tree.html#ae19ca02504d47a17836f0b0c533f8982">my_binary_tree&lt;T&gt;</a>* return_tree1=(<a class="code hl_function" href="classmy__binary__tree.html#ae19ca02504d47a17836f0b0c533f8982">my_binary_tree&lt;T&gt;</a>*)malloc(<span class="keyword">sizeof</span>(<a class="code hl_function" href="classmy__binary__tree.html#ae19ca02504d47a17836f0b0c533f8982">my_binary_tree&lt;T&gt;</a>));</div>
<div class="line"><a id="l00846" name="l00846"></a><span class="lineno">  846</span>        <a class="code hl_function" href="classmy__binary__tree.html#ae19ca02504d47a17836f0b0c533f8982">my_binary_tree&lt;T&gt;</a>* return_tree2=(<a class="code hl_function" href="classmy__binary__tree.html#ae19ca02504d47a17836f0b0c533f8982">my_binary_tree&lt;T&gt;</a>*)malloc(<span class="keyword">sizeof</span>(<a class="code hl_function" href="classmy__binary__tree.html#ae19ca02504d47a17836f0b0c533f8982">my_binary_tree&lt;T&gt;</a>));</div>
<div class="line"><a id="l00847" name="l00847"></a><span class="lineno">  847</span>        </div>
<div class="line"><a id="l00848" name="l00848"></a><span class="lineno">  848</span>        return_tree1=<span class="keyword">this</span>;</div>
<div class="line"><a id="l00849" name="l00849"></a><span class="lineno">  849</span>        return_tree1-&gt;<a class="code hl_variable" href="classmy__binary__tree.html#a8910dc810a9a95fe4dc308eeef739b6a">right</a>=<a class="code hl_variable" href="classmy__binary__tree.html#a8910dc810a9a95fe4dc308eeef739b6a">right</a>-&gt;left-&gt;left;</div>
<div class="line"><a id="l00850" name="l00850"></a><span class="lineno">  850</span>        return_tree2=<a class="code hl_variable" href="classmy__binary__tree.html#a8910dc810a9a95fe4dc308eeef739b6a">right</a>;</div>
<div class="line"><a id="l00851" name="l00851"></a><span class="lineno">  851</span>        return_tree2-&gt;<a class="code hl_variable" href="classmy__binary__tree.html#a69a6f187348e8b6219809620e784d3cf">left</a>=<a class="code hl_variable" href="classmy__binary__tree.html#a8910dc810a9a95fe4dc308eeef739b6a">right</a>-&gt;left-&gt;right;</div>
<div class="line"><a id="l00852" name="l00852"></a><span class="lineno">  852</span>        </div>
<div class="line"><a id="l00853" name="l00853"></a><span class="lineno">  853</span>        return_tree-&gt;<a class="code hl_variable" href="classmy__binary__tree.html#ae2d15edcaec6e5543a5e8c64ea0173cb">data</a>=<a class="code hl_variable" href="classmy__binary__tree.html#a8910dc810a9a95fe4dc308eeef739b6a">right</a>-&gt;left-&gt;data;</div>
<div class="line"><a id="l00854" name="l00854"></a><span class="lineno">  854</span>        return_tree-&gt;<a class="code hl_variable" href="classmy__binary__tree.html#a69a6f187348e8b6219809620e784d3cf">left</a>=return_tree1;</div>
<div class="line"><a id="l00855" name="l00855"></a><span class="lineno">  855</span>        return_tree-&gt;<a class="code hl_variable" href="classmy__binary__tree.html#a8910dc810a9a95fe4dc308eeef739b6a">right</a>=return_tree2;</div>
<div class="line"><a id="l00856" name="l00856"></a><span class="lineno">  856</span>        </div>
<div class="line"><a id="l00857" name="l00857"></a><span class="lineno">  857</span>        <span class="keywordflow">return</span> return_tree;     </div>
<div class="line"><a id="l00858" name="l00858"></a><span class="lineno">  858</span>    </div>
<div class="line"><a id="l00859" name="l00859"></a><span class="lineno">  859</span>    }</div>
<div class="line"><a id="l00860" name="l00860"></a><span class="lineno">  860</span>}</div>
</div>
<div class="line"><a id="l00861" name="l00861"></a><span class="lineno">  861</span> </div>
<div class="line"><a id="l00862" name="l00862"></a><span class="lineno">  862</span><span class="comment">//----------------------------------遍历操作------------------------------------</span></div>
<div class="line"><a id="l00863" name="l00863"></a><span class="lineno">  863</span><span class="comment">//遍历树,并打印</span></div>
<div class="line"><a id="l00864" name="l00864"></a><span class="lineno">  864</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T&gt;</div>
<div class="foldopen" id="foldopen00865" data-start="{" data-end="}">
<div class="line"><a id="l00865" name="l00865"></a><span class="lineno"><a class="line" href="classmy__binary__tree.html#a3b473ee42358d2ecda1958b1b72fd1dd">  865</a></span><span class="keywordtype">void</span> <a class="code hl_function" href="classmy__binary__tree.html#a3b473ee42358d2ecda1958b1b72fd1dd">my_binary_tree&lt;T&gt;::show_binary_tree</a>(<span class="keywordtype">string</span> mode) {</div>
<div class="line"><a id="l00866" name="l00866"></a><span class="lineno">  866</span>    <span class="keywordflow">if</span> (mode == <span class="stringliteral">&quot;first_root&quot;</span>) {  <span class="comment">// 先序遍历</span></div>
<div class="line"><a id="l00867" name="l00867"></a><span class="lineno">  867</span>        <span class="keywordflow">if</span> (<span class="keyword">this</span> == NULL) <span class="keywordflow">return</span>;</div>
<div class="line"><a id="l00868" name="l00868"></a><span class="lineno">  868</span>        cout &lt;&lt; <a class="code hl_variable" href="classmy__binary__tree.html#ae2d15edcaec6e5543a5e8c64ea0173cb">data</a> &lt;&lt; <span class="charliteral">&#39; &#39;</span>;</div>
<div class="line"><a id="l00869" name="l00869"></a><span class="lineno">  869</span>        <span class="keywordflow">if</span> (<a class="code hl_variable" href="classmy__binary__tree.html#a69a6f187348e8b6219809620e784d3cf">left</a>) <a class="code hl_variable" href="classmy__binary__tree.html#a69a6f187348e8b6219809620e784d3cf">left</a>-&gt;show_binary_tree(<span class="stringliteral">&quot;first_root&quot;</span>);</div>
<div class="line"><a id="l00870" name="l00870"></a><span class="lineno">  870</span>        <span class="keywordflow">if</span> (<a class="code hl_variable" href="classmy__binary__tree.html#a8910dc810a9a95fe4dc308eeef739b6a">right</a>) <a class="code hl_variable" href="classmy__binary__tree.html#a8910dc810a9a95fe4dc308eeef739b6a">right</a>-&gt;show_binary_tree(<span class="stringliteral">&quot;first_root&quot;</span>);</div>
<div class="line"><a id="l00871" name="l00871"></a><span class="lineno">  871</span>        <span class="keywordflow">return</span>;</div>
<div class="line"><a id="l00872" name="l00872"></a><span class="lineno">  872</span>    }</div>
<div class="line"><a id="l00873" name="l00873"></a><span class="lineno">  873</span>    <span class="keywordflow">if</span> (mode == <span class="stringliteral">&quot;mid_root&quot;</span>) {  <span class="comment">// 中序遍历</span></div>
<div class="line"><a id="l00874" name="l00874"></a><span class="lineno">  874</span>        <span class="keywordflow">if</span> (<span class="keyword">this</span> == NULL) <span class="keywordflow">return</span>;</div>
<div class="line"><a id="l00875" name="l00875"></a><span class="lineno">  875</span>        <span class="keywordflow">if</span> (<a class="code hl_variable" href="classmy__binary__tree.html#a69a6f187348e8b6219809620e784d3cf">left</a>) <a class="code hl_variable" href="classmy__binary__tree.html#a69a6f187348e8b6219809620e784d3cf">left</a>-&gt;show_binary_tree(<span class="stringliteral">&quot;mid_root&quot;</span>);</div>
<div class="line"><a id="l00876" name="l00876"></a><span class="lineno">  876</span>        cout &lt;&lt; <a class="code hl_variable" href="classmy__binary__tree.html#ae2d15edcaec6e5543a5e8c64ea0173cb">data</a> &lt;&lt; <span class="charliteral">&#39; &#39;</span>;</div>
<div class="line"><a id="l00877" name="l00877"></a><span class="lineno">  877</span>        <span class="keywordflow">if</span> (<a class="code hl_variable" href="classmy__binary__tree.html#a8910dc810a9a95fe4dc308eeef739b6a">right</a>) <a class="code hl_variable" href="classmy__binary__tree.html#a8910dc810a9a95fe4dc308eeef739b6a">right</a>-&gt;show_binary_tree(<span class="stringliteral">&quot;mid_root&quot;</span>);</div>
<div class="line"><a id="l00878" name="l00878"></a><span class="lineno">  878</span>        <span class="keywordflow">return</span>;</div>
<div class="line"><a id="l00879" name="l00879"></a><span class="lineno">  879</span>    }</div>
<div class="line"><a id="l00880" name="l00880"></a><span class="lineno">  880</span>    <span class="keywordflow">if</span> (mode == <span class="stringliteral">&quot;last_root&quot;</span>) {  <span class="comment">// 后序遍历</span></div>
<div class="line"><a id="l00881" name="l00881"></a><span class="lineno">  881</span>        <span class="keywordflow">if</span> (<span class="keyword">this</span> == NULL) <span class="keywordflow">return</span>;</div>
<div class="line"><a id="l00882" name="l00882"></a><span class="lineno">  882</span>        <span class="keywordflow">if</span> (<a class="code hl_variable" href="classmy__binary__tree.html#a69a6f187348e8b6219809620e784d3cf">left</a>) <a class="code hl_variable" href="classmy__binary__tree.html#a69a6f187348e8b6219809620e784d3cf">left</a>-&gt;show_binary_tree(<span class="stringliteral">&quot;last_root&quot;</span>);</div>
<div class="line"><a id="l00883" name="l00883"></a><span class="lineno">  883</span>        <span class="keywordflow">if</span> (<a class="code hl_variable" href="classmy__binary__tree.html#a8910dc810a9a95fe4dc308eeef739b6a">right</a>) <a class="code hl_variable" href="classmy__binary__tree.html#a8910dc810a9a95fe4dc308eeef739b6a">right</a>-&gt;show_binary_tree(<span class="stringliteral">&quot;last_root&quot;</span>);</div>
<div class="line"><a id="l00884" name="l00884"></a><span class="lineno">  884</span>        cout &lt;&lt; <a class="code hl_variable" href="classmy__binary__tree.html#ae2d15edcaec6e5543a5e8c64ea0173cb">data</a> &lt;&lt; <span class="charliteral">&#39; &#39;</span>;</div>
<div class="line"><a id="l00885" name="l00885"></a><span class="lineno">  885</span>        <span class="keywordflow">return</span>;</div>
<div class="line"><a id="l00886" name="l00886"></a><span class="lineno">  886</span>    }</div>
<div class="line"><a id="l00887" name="l00887"></a><span class="lineno">  887</span>    <span class="keywordflow">if</span> (mode == <span class="stringliteral">&quot;layer_first&quot;</span>) {  <span class="comment">// 层序遍历</span></div>
<div class="line"><a id="l00888" name="l00888"></a><span class="lineno">  888</span>        <span class="keywordflow">if</span> (<span class="keyword">this</span> == NULL) <span class="keywordflow">return</span>;</div>
<div class="line"><a id="l00889" name="l00889"></a><span class="lineno">  889</span>        queue&lt;my_binary_tree&lt;T&gt;*&gt; layer_first_queue;</div>
<div class="line"><a id="l00890" name="l00890"></a><span class="lineno">  890</span>        layer_first_queue.push(<span class="keyword">this</span>);</div>
<div class="line"><a id="l00891" name="l00891"></a><span class="lineno">  891</span>        <span class="keywordflow">while</span> (!layer_first_queue.empty()) {</div>
<div class="line"><a id="l00892" name="l00892"></a><span class="lineno">  892</span>            <a class="code hl_function" href="classmy__binary__tree.html#ae19ca02504d47a17836f0b0c533f8982">my_binary_tree&lt;T&gt;</a>* front = layer_first_queue.front();</div>
<div class="line"><a id="l00893" name="l00893"></a><span class="lineno">  893</span>            cout &lt;&lt; front-&gt;<a class="code hl_variable" href="classmy__binary__tree.html#ae2d15edcaec6e5543a5e8c64ea0173cb">data</a> &lt;&lt; <span class="charliteral">&#39; &#39;</span>;</div>
<div class="line"><a id="l00894" name="l00894"></a><span class="lineno">  894</span>            <span class="keywordflow">if</span> (front-&gt;<a class="code hl_variable" href="classmy__binary__tree.html#a69a6f187348e8b6219809620e784d3cf">left</a>) {</div>
<div class="line"><a id="l00895" name="l00895"></a><span class="lineno">  895</span>                layer_first_queue.push(front-&gt;<a class="code hl_variable" href="classmy__binary__tree.html#a69a6f187348e8b6219809620e784d3cf">left</a>);</div>
<div class="line"><a id="l00896" name="l00896"></a><span class="lineno">  896</span>            }</div>
<div class="line"><a id="l00897" name="l00897"></a><span class="lineno">  897</span>            <span class="keywordflow">if</span> (front-&gt;<a class="code hl_variable" href="classmy__binary__tree.html#a8910dc810a9a95fe4dc308eeef739b6a">right</a>) {</div>
<div class="line"><a id="l00898" name="l00898"></a><span class="lineno">  898</span>                layer_first_queue.push(front-&gt;<a class="code hl_variable" href="classmy__binary__tree.html#a8910dc810a9a95fe4dc308eeef739b6a">right</a>);</div>
<div class="line"><a id="l00899" name="l00899"></a><span class="lineno">  899</span>            }</div>
<div class="line"><a id="l00900" name="l00900"></a><span class="lineno">  900</span>            layer_first_queue.pop();</div>
<div class="line"><a id="l00901" name="l00901"></a><span class="lineno">  901</span>        }</div>
<div class="line"><a id="l00902" name="l00902"></a><span class="lineno">  902</span>        <span class="keywordflow">return</span>;</div>
<div class="line"><a id="l00903" name="l00903"></a><span class="lineno">  903</span>    }</div>
<div class="line"><a id="l00904" name="l00904"></a><span class="lineno">  904</span>}</div>
</div>
<div class="line"><a id="l00905" name="l00905"></a><span class="lineno">  905</span> </div>
<div class="line"><a id="l00906" name="l00906"></a><span class="lineno">  906</span><span class="comment">//遍历树,传入函数指针进行操作</span></div>
<div class="line"><a id="l00907" name="l00907"></a><span class="lineno">  907</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T&gt;</div>
<div class="line"><a id="l00908" name="l00908"></a><span class="lineno">  908</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> Function&gt;</div>
<div class="foldopen" id="foldopen00909" data-start="{" data-end="}">
<div class="line"><a id="l00909" name="l00909"></a><span class="lineno"><a class="line" href="classmy__binary__tree.html#a4a4f092d8f75d1f8840db3c3b4b6f36e">  909</a></span>Function <a class="code hl_function" href="classmy__binary__tree.html#a4a4f092d8f75d1f8840db3c3b4b6f36e">my_binary_tree&lt;T&gt;::traversal_binary_tree</a>(<span class="keywordtype">string</span> mode, Function F) {</div>
<div class="line"><a id="l00910" name="l00910"></a><span class="lineno">  910</span>    <span class="keywordflow">if</span> (mode == <span class="stringliteral">&quot;first_root&quot;</span>) {</div>
<div class="line"><a id="l00911" name="l00911"></a><span class="lineno">  911</span>        <span class="keywordflow">if</span> (<span class="keyword">this</span> == NULL) <span class="keywordflow">return</span> F;</div>
<div class="line"><a id="l00912" name="l00912"></a><span class="lineno">  912</span>        F(<a class="code hl_variable" href="classmy__binary__tree.html#ae2d15edcaec6e5543a5e8c64ea0173cb">data</a>);</div>
<div class="line"><a id="l00913" name="l00913"></a><span class="lineno">  913</span>        <span class="keywordflow">if</span> (<a class="code hl_variable" href="classmy__binary__tree.html#a69a6f187348e8b6219809620e784d3cf">left</a>) <a class="code hl_variable" href="classmy__binary__tree.html#a69a6f187348e8b6219809620e784d3cf">left</a>-&gt;traversal_binary_tree(<span class="stringliteral">&quot;first_root&quot;</span>, F);</div>
<div class="line"><a id="l00914" name="l00914"></a><span class="lineno">  914</span>        <span class="keywordflow">if</span> (<a class="code hl_variable" href="classmy__binary__tree.html#a8910dc810a9a95fe4dc308eeef739b6a">right</a>) <a class="code hl_variable" href="classmy__binary__tree.html#a8910dc810a9a95fe4dc308eeef739b6a">right</a>-&gt;traversal_binary_tree(<span class="stringliteral">&quot;first_root&quot;</span>, F);</div>
<div class="line"><a id="l00915" name="l00915"></a><span class="lineno">  915</span>        <span class="keywordflow">return</span> F;</div>
<div class="line"><a id="l00916" name="l00916"></a><span class="lineno">  916</span>    }</div>
<div class="line"><a id="l00917" name="l00917"></a><span class="lineno">  917</span>    <span class="keywordflow">if</span> (mode == <span class="stringliteral">&quot;mid_root&quot;</span>) {</div>
<div class="line"><a id="l00918" name="l00918"></a><span class="lineno">  918</span>        <span class="keywordflow">if</span> (<span class="keyword">this</span> == NULL) <span class="keywordflow">return</span> F;</div>
<div class="line"><a id="l00919" name="l00919"></a><span class="lineno">  919</span>        <span class="keywordflow">if</span> (<a class="code hl_variable" href="classmy__binary__tree.html#a69a6f187348e8b6219809620e784d3cf">left</a>) <a class="code hl_variable" href="classmy__binary__tree.html#a69a6f187348e8b6219809620e784d3cf">left</a>-&gt;traversal_binary_tree(<span class="stringliteral">&quot;mid_root&quot;</span>, F);</div>
<div class="line"><a id="l00920" name="l00920"></a><span class="lineno">  920</span>        F(<a class="code hl_variable" href="classmy__binary__tree.html#ae2d15edcaec6e5543a5e8c64ea0173cb">data</a>);</div>
<div class="line"><a id="l00921" name="l00921"></a><span class="lineno">  921</span>        <span class="keywordflow">if</span> (<a class="code hl_variable" href="classmy__binary__tree.html#a8910dc810a9a95fe4dc308eeef739b6a">right</a>) <a class="code hl_variable" href="classmy__binary__tree.html#a8910dc810a9a95fe4dc308eeef739b6a">right</a>-&gt;traversal_binary_tree(<span class="stringliteral">&quot;mid_root&quot;</span>, F);</div>
<div class="line"><a id="l00922" name="l00922"></a><span class="lineno">  922</span>        <span class="keywordflow">return</span> F;</div>
<div class="line"><a id="l00923" name="l00923"></a><span class="lineno">  923</span>    }</div>
<div class="line"><a id="l00924" name="l00924"></a><span class="lineno">  924</span>    <span class="keywordflow">if</span> (mode == <span class="stringliteral">&quot;last_root&quot;</span>) {</div>
<div class="line"><a id="l00925" name="l00925"></a><span class="lineno">  925</span>        <span class="keywordflow">if</span> (<span class="keyword">this</span> == NULL) <span class="keywordflow">return</span> F;</div>
<div class="line"><a id="l00926" name="l00926"></a><span class="lineno">  926</span>        <span class="keywordflow">if</span> (<a class="code hl_variable" href="classmy__binary__tree.html#a69a6f187348e8b6219809620e784d3cf">left</a>) <a class="code hl_variable" href="classmy__binary__tree.html#a69a6f187348e8b6219809620e784d3cf">left</a>-&gt;traversal_binary_tree(<span class="stringliteral">&quot;last_root&quot;</span>, F);</div>
<div class="line"><a id="l00927" name="l00927"></a><span class="lineno">  927</span>        <span class="keywordflow">if</span> (<a class="code hl_variable" href="classmy__binary__tree.html#a8910dc810a9a95fe4dc308eeef739b6a">right</a>) <a class="code hl_variable" href="classmy__binary__tree.html#a8910dc810a9a95fe4dc308eeef739b6a">right</a>-&gt;traversal_binary_tree(<span class="stringliteral">&quot;last_root&quot;</span>, F);</div>
<div class="line"><a id="l00928" name="l00928"></a><span class="lineno">  928</span>        F(<a class="code hl_variable" href="classmy__binary__tree.html#ae2d15edcaec6e5543a5e8c64ea0173cb">data</a>);</div>
<div class="line"><a id="l00929" name="l00929"></a><span class="lineno">  929</span>        <span class="keywordflow">return</span> F;</div>
<div class="line"><a id="l00930" name="l00930"></a><span class="lineno">  930</span>    }</div>
<div class="line"><a id="l00931" name="l00931"></a><span class="lineno">  931</span>    <span class="keywordflow">if</span> (mode == <span class="stringliteral">&quot;layer_first&quot;</span>) {</div>
<div class="line"><a id="l00932" name="l00932"></a><span class="lineno">  932</span>        <span class="keywordflow">if</span> (<span class="keyword">this</span> == NULL) <span class="keywordflow">return</span> F;</div>
<div class="line"><a id="l00933" name="l00933"></a><span class="lineno">  933</span>        queue&lt;my_binary_tree&lt;T&gt;*&gt; layer_first_queue;</div>
<div class="line"><a id="l00934" name="l00934"></a><span class="lineno">  934</span>        layer_first_queue.push(<span class="keyword">this</span>);</div>
<div class="line"><a id="l00935" name="l00935"></a><span class="lineno">  935</span>        <span class="keywordflow">while</span> (!layer_first_queue.empty()) {</div>
<div class="line"><a id="l00936" name="l00936"></a><span class="lineno">  936</span>            <a class="code hl_function" href="classmy__binary__tree.html#ae19ca02504d47a17836f0b0c533f8982">my_binary_tree&lt;T&gt;</a>* front = layer_first_queue.front();</div>
<div class="line"><a id="l00937" name="l00937"></a><span class="lineno">  937</span>            F(front-&gt;<a class="code hl_variable" href="classmy__binary__tree.html#ae2d15edcaec6e5543a5e8c64ea0173cb">data</a>);</div>
<div class="line"><a id="l00938" name="l00938"></a><span class="lineno">  938</span>            <span class="keywordflow">if</span> (front-&gt;<a class="code hl_variable" href="classmy__binary__tree.html#a69a6f187348e8b6219809620e784d3cf">left</a>) {</div>
<div class="line"><a id="l00939" name="l00939"></a><span class="lineno">  939</span>                layer_first_queue.push(front-&gt;<a class="code hl_variable" href="classmy__binary__tree.html#a69a6f187348e8b6219809620e784d3cf">left</a>);</div>
<div class="line"><a id="l00940" name="l00940"></a><span class="lineno">  940</span>            }</div>
<div class="line"><a id="l00941" name="l00941"></a><span class="lineno">  941</span>            <span class="keywordflow">if</span> (front-&gt;<a class="code hl_variable" href="classmy__binary__tree.html#a8910dc810a9a95fe4dc308eeef739b6a">right</a>) {</div>
<div class="line"><a id="l00942" name="l00942"></a><span class="lineno">  942</span>                layer_first_queue.push(front-&gt;<a class="code hl_variable" href="classmy__binary__tree.html#a8910dc810a9a95fe4dc308eeef739b6a">right</a>);</div>
<div class="line"><a id="l00943" name="l00943"></a><span class="lineno">  943</span>            }</div>
<div class="line"><a id="l00944" name="l00944"></a><span class="lineno">  944</span>            layer_first_queue.pop();</div>
<div class="line"><a id="l00945" name="l00945"></a><span class="lineno">  945</span>        }</div>
<div class="line"><a id="l00946" name="l00946"></a><span class="lineno">  946</span>        <span class="keywordflow">return</span> F;</div>
<div class="line"><a id="l00947" name="l00947"></a><span class="lineno">  947</span>    }</div>
<div class="line"><a id="l00948" name="l00948"></a><span class="lineno">  948</span>    <span class="keywordflow">return</span> F;</div>
<div class="line"><a id="l00949" name="l00949"></a><span class="lineno">  949</span>}</div>
</div>
<div class="line"><a id="l00950" name="l00950"></a><span class="lineno">  950</span> </div>
<div class="line"><a id="l00951" name="l00951"></a><span class="lineno">  951</span><span class="comment">//遍历树,传入函数指针（含空节点处理）</span></div>
<div class="line"><a id="l00952" name="l00952"></a><span class="lineno">  952</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T&gt;</div>
<div class="line"><a id="l00953" name="l00953"></a><span class="lineno">  953</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> Function1, <span class="keyword">typename</span> Function2&gt;</div>
<div class="foldopen" id="foldopen00954" data-start="{" data-end="}">
<div class="line"><a id="l00954" name="l00954"></a><span class="lineno"><a class="line" href="classmy__binary__tree.html#ad3840bd8912df340bc10aa59bc89d1bd">  954</a></span>Function1 <a class="code hl_function" href="classmy__binary__tree.html#a4a4f092d8f75d1f8840db3c3b4b6f36e">my_binary_tree&lt;T&gt;::traversal_binary_tree</a>(<span class="keywordtype">string</span> mode, Function1 F1, Function2 F2) {</div>
<div class="line"><a id="l00955" name="l00955"></a><span class="lineno">  955</span>    <span class="keywordflow">if</span> (mode == <span class="stringliteral">&quot;first_root&quot;</span>) {</div>
<div class="line"><a id="l00956" name="l00956"></a><span class="lineno">  956</span>        <span class="keywordflow">if</span> (<span class="keyword">this</span> == NULL) {</div>
<div class="line"><a id="l00957" name="l00957"></a><span class="lineno">  957</span>            F2();</div>
<div class="line"><a id="l00958" name="l00958"></a><span class="lineno">  958</span>            <span class="keywordflow">return</span> F1;</div>
<div class="line"><a id="l00959" name="l00959"></a><span class="lineno">  959</span>        }</div>
<div class="line"><a id="l00960" name="l00960"></a><span class="lineno">  960</span>        F1(<a class="code hl_variable" href="classmy__binary__tree.html#ae2d15edcaec6e5543a5e8c64ea0173cb">data</a>);</div>
<div class="line"><a id="l00961" name="l00961"></a><span class="lineno">  961</span>        <span class="keywordflow">if</span> (<a class="code hl_variable" href="classmy__binary__tree.html#a69a6f187348e8b6219809620e784d3cf">left</a>) <a class="code hl_variable" href="classmy__binary__tree.html#a69a6f187348e8b6219809620e784d3cf">left</a>-&gt;traversal_binary_tree(<span class="stringliteral">&quot;first_root&quot;</span>, F1, F2);</div>
<div class="line"><a id="l00962" name="l00962"></a><span class="lineno">  962</span>        <span class="keywordflow">else</span> F2();  <span class="comment">// 左子树为空时调用F2</span></div>
<div class="line"><a id="l00963" name="l00963"></a><span class="lineno">  963</span>        <span class="keywordflow">if</span> (<a class="code hl_variable" href="classmy__binary__tree.html#a8910dc810a9a95fe4dc308eeef739b6a">right</a>) <a class="code hl_variable" href="classmy__binary__tree.html#a8910dc810a9a95fe4dc308eeef739b6a">right</a>-&gt;traversal_binary_tree(<span class="stringliteral">&quot;first_root&quot;</span>, F1, F2);</div>
<div class="line"><a id="l00964" name="l00964"></a><span class="lineno">  964</span>        <span class="keywordflow">else</span> F2();  <span class="comment">// 右子树为空时调用F2</span></div>
<div class="line"><a id="l00965" name="l00965"></a><span class="lineno">  965</span>        <span class="keywordflow">return</span> F1;</div>
<div class="line"><a id="l00966" name="l00966"></a><span class="lineno">  966</span>    }</div>
<div class="line"><a id="l00967" name="l00967"></a><span class="lineno">  967</span>    <span class="keywordflow">if</span> (mode == <span class="stringliteral">&quot;mid_root&quot;</span>) {</div>
<div class="line"><a id="l00968" name="l00968"></a><span class="lineno">  968</span>        <span class="keywordflow">if</span> (<span class="keyword">this</span> == NULL) {</div>
<div class="line"><a id="l00969" name="l00969"></a><span class="lineno">  969</span>            F2();</div>
<div class="line"><a id="l00970" name="l00970"></a><span class="lineno">  970</span>            <span class="keywordflow">return</span> F1;</div>
<div class="line"><a id="l00971" name="l00971"></a><span class="lineno">  971</span>        }</div>
<div class="line"><a id="l00972" name="l00972"></a><span class="lineno">  972</span>        <span class="keywordflow">if</span> (<a class="code hl_variable" href="classmy__binary__tree.html#a69a6f187348e8b6219809620e784d3cf">left</a>) <a class="code hl_variable" href="classmy__binary__tree.html#a69a6f187348e8b6219809620e784d3cf">left</a>-&gt;traversal_binary_tree(<span class="stringliteral">&quot;mid_root&quot;</span>, F1, F2);</div>
<div class="line"><a id="l00973" name="l00973"></a><span class="lineno">  973</span>        <span class="keywordflow">else</span> F2();</div>
<div class="line"><a id="l00974" name="l00974"></a><span class="lineno">  974</span>        F1(<a class="code hl_variable" href="classmy__binary__tree.html#ae2d15edcaec6e5543a5e8c64ea0173cb">data</a>);</div>
<div class="line"><a id="l00975" name="l00975"></a><span class="lineno">  975</span>        <span class="keywordflow">if</span> (<a class="code hl_variable" href="classmy__binary__tree.html#a8910dc810a9a95fe4dc308eeef739b6a">right</a>) <a class="code hl_variable" href="classmy__binary__tree.html#a8910dc810a9a95fe4dc308eeef739b6a">right</a>-&gt;traversal_binary_tree(<span class="stringliteral">&quot;mid_root&quot;</span>, F1, F2);</div>
<div class="line"><a id="l00976" name="l00976"></a><span class="lineno">  976</span>        <span class="keywordflow">else</span> F2();</div>
<div class="line"><a id="l00977" name="l00977"></a><span class="lineno">  977</span>        <span class="keywordflow">return</span> F1;</div>
<div class="line"><a id="l00978" name="l00978"></a><span class="lineno">  978</span>    }</div>
<div class="line"><a id="l00979" name="l00979"></a><span class="lineno">  979</span>    <span class="keywordflow">if</span> (mode == <span class="stringliteral">&quot;last_root&quot;</span>) {</div>
<div class="line"><a id="l00980" name="l00980"></a><span class="lineno">  980</span>        <span class="keywordflow">if</span> (<span class="keyword">this</span> == NULL) {</div>
<div class="line"><a id="l00981" name="l00981"></a><span class="lineno">  981</span>            F2();</div>
<div class="line"><a id="l00982" name="l00982"></a><span class="lineno">  982</span>            <span class="keywordflow">return</span> F1;</div>
<div class="line"><a id="l00983" name="l00983"></a><span class="lineno">  983</span>        }</div>
<div class="line"><a id="l00984" name="l00984"></a><span class="lineno">  984</span>        <span class="keywordflow">if</span> (<a class="code hl_variable" href="classmy__binary__tree.html#a69a6f187348e8b6219809620e784d3cf">left</a>) <a class="code hl_variable" href="classmy__binary__tree.html#a69a6f187348e8b6219809620e784d3cf">left</a>-&gt;traversal_binary_tree(<span class="stringliteral">&quot;last_root&quot;</span>, F1, F2);</div>
<div class="line"><a id="l00985" name="l00985"></a><span class="lineno">  985</span>        <span class="keywordflow">else</span> F2();</div>
<div class="line"><a id="l00986" name="l00986"></a><span class="lineno">  986</span>        <span class="keywordflow">if</span> (<a class="code hl_variable" href="classmy__binary__tree.html#a8910dc810a9a95fe4dc308eeef739b6a">right</a>) <a class="code hl_variable" href="classmy__binary__tree.html#a8910dc810a9a95fe4dc308eeef739b6a">right</a>-&gt;traversal_binary_tree(<span class="stringliteral">&quot;last_root&quot;</span>, F1, F2);</div>
<div class="line"><a id="l00987" name="l00987"></a><span class="lineno">  987</span>        <span class="keywordflow">else</span> F2();</div>
<div class="line"><a id="l00988" name="l00988"></a><span class="lineno">  988</span>        F1(<a class="code hl_variable" href="classmy__binary__tree.html#ae2d15edcaec6e5543a5e8c64ea0173cb">data</a>);</div>
<div class="line"><a id="l00989" name="l00989"></a><span class="lineno">  989</span>        <span class="keywordflow">return</span> F1;</div>
<div class="line"><a id="l00990" name="l00990"></a><span class="lineno">  990</span>    }</div>
<div class="line"><a id="l00991" name="l00991"></a><span class="lineno">  991</span>    <span class="keywordflow">if</span> (mode == <span class="stringliteral">&quot;layer_first&quot;</span>) {</div>
<div class="line"><a id="l00992" name="l00992"></a><span class="lineno">  992</span>        <span class="keywordtype">int</span> height = <a class="code hl_function" href="classmy__binary__tree.html#a047c1a5b1fb76a0cb62700eb1c53bb8b">get_height</a>();</div>
<div class="line"><a id="l00993" name="l00993"></a><span class="lineno">  993</span>        <span class="keywordtype">int</span> level = 1;</div>
<div class="line"><a id="l00994" name="l00994"></a><span class="lineno">  994</span>        <span class="keywordtype">int</span> num = 1;</div>
<div class="line"><a id="l00995" name="l00995"></a><span class="lineno">  995</span>        <span class="keywordflow">if</span> (<span class="keyword">this</span> == NULL) {</div>
<div class="line"><a id="l00996" name="l00996"></a><span class="lineno">  996</span>            F2();</div>
<div class="line"><a id="l00997" name="l00997"></a><span class="lineno">  997</span>            <span class="keywordflow">return</span> F1;</div>
<div class="line"><a id="l00998" name="l00998"></a><span class="lineno">  998</span>        }</div>
<div class="line"><a id="l00999" name="l00999"></a><span class="lineno">  999</span>        queue&lt;my_binary_tree&lt;T&gt;*&gt; layer_first_queue;</div>
<div class="line"><a id="l01000" name="l01000"></a><span class="lineno"> 1000</span>        layer_first_queue.push(<span class="keyword">this</span>);</div>
<div class="line"><a id="l01001" name="l01001"></a><span class="lineno"> 1001</span>        <span class="keywordflow">while</span> (level &lt;= height) {</div>
<div class="line"><a id="l01002" name="l01002"></a><span class="lineno"> 1002</span>            <a class="code hl_function" href="classmy__binary__tree.html#ae19ca02504d47a17836f0b0c533f8982">my_binary_tree&lt;T&gt;</a>* front = layer_first_queue.front();</div>
<div class="line"><a id="l01003" name="l01003"></a><span class="lineno"> 1003</span>            <span class="keywordflow">if</span> (front == NULL) {</div>
<div class="line"><a id="l01004" name="l01004"></a><span class="lineno"> 1004</span>                F2();</div>
<div class="line"><a id="l01005" name="l01005"></a><span class="lineno"> 1005</span>                layer_first_queue.push(NULL);</div>
<div class="line"><a id="l01006" name="l01006"></a><span class="lineno"> 1006</span>                layer_first_queue.push(NULL);</div>
<div class="line"><a id="l01007" name="l01007"></a><span class="lineno"> 1007</span>            } <span class="keywordflow">else</span> {</div>
<div class="line"><a id="l01008" name="l01008"></a><span class="lineno"> 1008</span>                function_counter = num - 1;</div>
<div class="line"><a id="l01009" name="l01009"></a><span class="lineno"> 1009</span>                F1(front-&gt;<a class="code hl_variable" href="classmy__binary__tree.html#ae2d15edcaec6e5543a5e8c64ea0173cb">data</a>);</div>
<div class="line"><a id="l01010" name="l01010"></a><span class="lineno"> 1010</span>                layer_first_queue.push(front-&gt;<a class="code hl_variable" href="classmy__binary__tree.html#a69a6f187348e8b6219809620e784d3cf">left</a>);  <span class="comment">// 空指针会被后续处理</span></div>
<div class="line"><a id="l01011" name="l01011"></a><span class="lineno"> 1011</span>                layer_first_queue.push(front-&gt;<a class="code hl_variable" href="classmy__binary__tree.html#a8910dc810a9a95fe4dc308eeef739b6a">right</a>);</div>
<div class="line"><a id="l01012" name="l01012"></a><span class="lineno"> 1012</span>            }</div>
<div class="line"><a id="l01013" name="l01013"></a><span class="lineno"> 1013</span>            layer_first_queue.pop();</div>
<div class="line"><a id="l01014" name="l01014"></a><span class="lineno"> 1014</span>            num++;</div>
<div class="line"><a id="l01015" name="l01015"></a><span class="lineno"> 1015</span>            <span class="keywordflow">if</span> (is_2_power(num, height)) {</div>
<div class="line"><a id="l01016" name="l01016"></a><span class="lineno"> 1016</span>                level++;</div>
<div class="line"><a id="l01017" name="l01017"></a><span class="lineno"> 1017</span>            }</div>
<div class="line"><a id="l01018" name="l01018"></a><span class="lineno"> 1018</span>        }</div>
<div class="line"><a id="l01019" name="l01019"></a><span class="lineno"> 1019</span>        <span class="keywordflow">return</span> F1;</div>
<div class="line"><a id="l01020" name="l01020"></a><span class="lineno"> 1020</span>    }</div>
<div class="line"><a id="l01021" name="l01021"></a><span class="lineno"> 1021</span>    <span class="keywordflow">return</span> F1;</div>
<div class="line"><a id="l01022" name="l01022"></a><span class="lineno"> 1022</span>}</div>
</div>
<div class="line"><a id="l01023" name="l01023"></a><span class="lineno"> 1023</span> </div>
<div class="line"><a id="l01024" name="l01024"></a><span class="lineno"> 1024</span><span class="comment">//按照层先法压入向量中（不含占位符）</span></div>
<div class="line"><a id="l01025" name="l01025"></a><span class="lineno"> 1025</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T&gt;</div>
<div class="foldopen" id="foldopen01026" data-start="{" data-end="}">
<div class="line"><a id="l01026" name="l01026"></a><span class="lineno"><a class="line" href="classmy__binary__tree.html#aff9c3c138c4fc970016a826ec0653eaf"> 1026</a></span><span class="keywordtype">void</span> <a class="code hl_function" href="classmy__binary__tree.html#aff9c3c138c4fc970016a826ec0653eaf">my_binary_tree&lt;T&gt;::print_full_to_vector</a>(vector&lt;T&gt;&amp; vv) {</div>
<div class="line"><a id="l01027" name="l01027"></a><span class="lineno"> 1027</span>    <span class="keyword">auto</span> bound_func = bind(print_fulltov, ref(vv), placeholders::_1);</div>
<div class="line"><a id="l01028" name="l01028"></a><span class="lineno"> 1028</span>    <a class="code hl_function" href="classmy__binary__tree.html#a4a4f092d8f75d1f8840db3c3b4b6f36e">traversal_binary_tree</a>(<span class="stringliteral">&quot;layer_first&quot;</span>, bound_func);</div>
<div class="line"><a id="l01029" name="l01029"></a><span class="lineno"> 1029</span>}</div>
</div>
<div class="line"><a id="l01030" name="l01030"></a><span class="lineno"> 1030</span> </div>
<div class="line"><a id="l01031" name="l01031"></a><span class="lineno"> 1031</span><span class="comment">//按照层先法压入向量中（含占位符）</span></div>
<div class="line"><a id="l01032" name="l01032"></a><span class="lineno"> 1032</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T&gt;</div>
<div class="foldopen" id="foldopen01033" data-start="{" data-end="}">
<div class="line"><a id="l01033" name="l01033"></a><span class="lineno"><a class="line" href="classmy__binary__tree.html#aa65e9e0bae93b835e20c32de429928d3"> 1033</a></span><span class="keywordtype">void</span> <a class="code hl_function" href="classmy__binary__tree.html#aa65e9e0bae93b835e20c32de429928d3">my_binary_tree&lt;T&gt;::print_to_vector</a>(vector&lt;T&gt;&amp; vv) {</div>
<div class="line"><a id="l01034" name="l01034"></a><span class="lineno"> 1034</span>    <span class="keyword">auto</span> bound_func1 = bind(print_tov, ref(vv), placeholders::_1);</div>
<div class="line"><a id="l01035" name="l01035"></a><span class="lineno"> 1035</span>    <a class="code hl_function" href="classmy__binary__tree.html#a4a4f092d8f75d1f8840db3c3b4b6f36e">traversal_binary_tree</a>(<span class="stringliteral">&quot;layer_first&quot;</span>, bound_func1, empty_function);</div>
<div class="line"><a id="l01036" name="l01036"></a><span class="lineno"> 1036</span>}</div>
</div>
<div class="line"><a id="l01037" name="l01037"></a><span class="lineno"> 1037</span> </div>
<div class="line"><a id="l01038" name="l01038"></a><span class="lineno"> 1038</span><span class="comment">//----------------------------------操作符重载------------------------------------</span></div>
<div class="line"><a id="l01039" name="l01039"></a><span class="lineno"> 1039</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T&gt;</div>
<div class="foldopen" id="foldopen01040" data-start="{" data-end="}">
<div class="line"><a id="l01040" name="l01040"></a><span class="lineno"><a class="line" href="classmy__binary__tree.html#a9b5581a82079878a7faac62d07bbcc12"> 1040</a></span><span class="keywordtype">bool</span> <a class="code hl_friend" href="classmy__binary__tree.html#a9b5581a82079878a7faac62d07bbcc12">operator==</a>(<a class="code hl_function" href="classmy__binary__tree.html#ae19ca02504d47a17836f0b0c533f8982">my_binary_tree&lt;T&gt;</a> lhs, <a class="code hl_function" href="classmy__binary__tree.html#ae19ca02504d47a17836f0b0c533f8982">my_binary_tree&lt;T&gt;</a> rhs) {</div>
<div class="line"><a id="l01041" name="l01041"></a><span class="lineno"> 1041</span>    <span class="keywordflow">if</span> (lhs.<a class="code hl_variable" href="classmy__binary__tree.html#a69a6f187348e8b6219809620e784d3cf">left</a> == NULL &amp;&amp; lhs.<a class="code hl_variable" href="classmy__binary__tree.html#a8910dc810a9a95fe4dc308eeef739b6a">right</a> == NULL &amp;&amp;</div>
<div class="line"><a id="l01042" name="l01042"></a><span class="lineno"> 1042</span>        rhs.<a class="code hl_variable" href="classmy__binary__tree.html#a69a6f187348e8b6219809620e784d3cf">left</a> == NULL &amp;&amp; rhs.<a class="code hl_variable" href="classmy__binary__tree.html#a8910dc810a9a95fe4dc308eeef739b6a">right</a> == NULL) {</div>
<div class="line"><a id="l01043" name="l01043"></a><span class="lineno"> 1043</span>        <span class="keywordflow">return</span> lhs.<a class="code hl_variable" href="classmy__binary__tree.html#ae2d15edcaec6e5543a5e8c64ea0173cb">data</a> == rhs.<a class="code hl_variable" href="classmy__binary__tree.html#ae2d15edcaec6e5543a5e8c64ea0173cb">data</a>;</div>
<div class="line"><a id="l01044" name="l01044"></a><span class="lineno"> 1044</span>    }</div>
<div class="line"><a id="l01045" name="l01045"></a><span class="lineno"> 1045</span>    <span class="keywordflow">if</span> ((lhs.<a class="code hl_variable" href="classmy__binary__tree.html#a69a6f187348e8b6219809620e784d3cf">left</a> == NULL) != (rhs.<a class="code hl_variable" href="classmy__binary__tree.html#a69a6f187348e8b6219809620e784d3cf">left</a> == NULL) ||</div>
<div class="line"><a id="l01046" name="l01046"></a><span class="lineno"> 1046</span>        (lhs.<a class="code hl_variable" href="classmy__binary__tree.html#a8910dc810a9a95fe4dc308eeef739b6a">right</a> == NULL) != (rhs.<a class="code hl_variable" href="classmy__binary__tree.html#a8910dc810a9a95fe4dc308eeef739b6a">right</a> == NULL)) {</div>
<div class="line"><a id="l01047" name="l01047"></a><span class="lineno"> 1047</span>        <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
<div class="line"><a id="l01048" name="l01048"></a><span class="lineno"> 1048</span>    }</div>
<div class="line"><a id="l01049" name="l01049"></a><span class="lineno"> 1049</span>    <span class="keywordtype">bool</span> currentEqual = (lhs.<a class="code hl_variable" href="classmy__binary__tree.html#ae2d15edcaec6e5543a5e8c64ea0173cb">data</a> == rhs.<a class="code hl_variable" href="classmy__binary__tree.html#ae2d15edcaec6e5543a5e8c64ea0173cb">data</a>);</div>
<div class="line"><a id="l01050" name="l01050"></a><span class="lineno"> 1050</span>    <span class="keywordtype">bool</span> leftEqual = (lhs.<a class="code hl_variable" href="classmy__binary__tree.html#a69a6f187348e8b6219809620e784d3cf">left</a> != NULL) ? (*lhs.<a class="code hl_variable" href="classmy__binary__tree.html#a69a6f187348e8b6219809620e784d3cf">left</a> == *rhs.<a class="code hl_variable" href="classmy__binary__tree.html#a69a6f187348e8b6219809620e784d3cf">left</a>) : <span class="keyword">true</span>;</div>
<div class="line"><a id="l01051" name="l01051"></a><span class="lineno"> 1051</span>    <span class="keywordtype">bool</span> rightEqual = (lhs.<a class="code hl_variable" href="classmy__binary__tree.html#a8910dc810a9a95fe4dc308eeef739b6a">right</a> != NULL) ? (*lhs.<a class="code hl_variable" href="classmy__binary__tree.html#a8910dc810a9a95fe4dc308eeef739b6a">right</a> == *rhs.<a class="code hl_variable" href="classmy__binary__tree.html#a8910dc810a9a95fe4dc308eeef739b6a">right</a>) : <span class="keyword">true</span>;</div>
<div class="line"><a id="l01052" name="l01052"></a><span class="lineno"> 1052</span>    <span class="keywordflow">return</span> currentEqual &amp;&amp; leftEqual &amp;&amp; rightEqual;</div>
<div class="line"><a id="l01053" name="l01053"></a><span class="lineno"> 1053</span>}</div>
</div>
<div class="line"><a id="l01054" name="l01054"></a><span class="lineno"> 1054</span> </div>
<div class="line"><a id="l01055" name="l01055"></a><span class="lineno"> 1055</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T&gt;</div>
<div class="foldopen" id="foldopen01056" data-start="{" data-end="}">
<div class="line"><a id="l01056" name="l01056"></a><span class="lineno"><a class="line" href="classmy__binary__tree.html#a57bcf0e8e11dcb2db4d3c2b72e62d913"> 1056</a></span><span class="keywordtype">bool</span> <a class="code hl_friend" href="classmy__binary__tree.html#a57bcf0e8e11dcb2db4d3c2b72e62d913">operator!=</a>(<a class="code hl_function" href="classmy__binary__tree.html#ae19ca02504d47a17836f0b0c533f8982">my_binary_tree&lt;T&gt;</a> lhs, <a class="code hl_function" href="classmy__binary__tree.html#ae19ca02504d47a17836f0b0c533f8982">my_binary_tree&lt;T&gt;</a> rhs) {</div>
<div class="line"><a id="l01057" name="l01057"></a><span class="lineno"> 1057</span>    <span class="keywordflow">return</span> !(lhs == rhs);</div>
<div class="line"><a id="l01058" name="l01058"></a><span class="lineno"> 1058</span>}</div>
</div>
<div class="line"><a id="l01059" name="l01059"></a><span class="lineno"> 1059</span> </div>
<div class="line"><a id="l01060" name="l01060"></a><span class="lineno"> 1060</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T&gt;</div>
<div class="foldopen" id="foldopen01061" data-start="{" data-end="}">
<div class="line"><a id="l01061" name="l01061"></a><span class="lineno"><a class="line" href="classmy__binary__tree.html#a9b9d88b02caf22fc6de3a78e3a514816"> 1061</a></span>ostream&amp; <a class="code hl_friend" href="classmy__binary__tree.html#a9b9d88b02caf22fc6de3a78e3a514816">operator&lt;&lt;</a>(ostream&amp; os, <a class="code hl_function" href="classmy__binary__tree.html#ae19ca02504d47a17836f0b0c533f8982">my_binary_tree&lt;T&gt;</a> p) {</div>
<div class="line"><a id="l01062" name="l01062"></a><span class="lineno"> 1062</span>    os &lt;&lt; <span class="stringliteral">&quot;now let&#39;s draw a tree&quot;</span> &lt;&lt; endl;</div>
<div class="line"><a id="l01063" name="l01063"></a><span class="lineno"> 1063</span>    <span class="keywordtype">int</span> height = p.<a class="code hl_function" href="classmy__binary__tree.html#a047c1a5b1fb76a0cb62700eb1c53bb8b">get_height</a>();</div>
<div class="line"><a id="l01064" name="l01064"></a><span class="lineno"> 1064</span>    <span class="keywordtype">int</span> h = 1;</div>
<div class="line"><a id="l01065" name="l01065"></a><span class="lineno"> 1065</span>    vector&lt;int&gt; sum_pow_of_2;</div>
<div class="line"><a id="l01066" name="l01066"></a><span class="lineno"> 1066</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> j = 1; j &lt;= height; j++) {</div>
<div class="line"><a id="l01067" name="l01067"></a><span class="lineno"> 1067</span>        sum_pow_of_2.push_back(pow(2, j) - 1);</div>
<div class="line"><a id="l01068" name="l01068"></a><span class="lineno"> 1068</span>    }</div>
<div class="line"><a id="l01069" name="l01069"></a><span class="lineno"> 1069</span>    <span class="keywordtype">int</span> sum = pow(2, height) - 1;</div>
<div class="line"><a id="l01070" name="l01070"></a><span class="lineno"> 1070</span>    <span class="keywordtype">int</span> i = 0;</div>
<div class="line"><a id="l01071" name="l01071"></a><span class="lineno"> 1071</span>    vector&lt;T&gt; vv(sum, space);  <span class="comment">// 初始化向量为占位符</span></div>
<div class="line"><a id="l01072" name="l01072"></a><span class="lineno"> 1072</span>    p.<a class="code hl_function" href="classmy__binary__tree.html#aa65e9e0bae93b835e20c32de429928d3">print_to_vector</a>(vv);</div>
<div class="line"><a id="l01073" name="l01073"></a><span class="lineno"> 1073</span>    os &lt;&lt; <span class="stringliteral">&quot;--------------&quot;</span> &lt;&lt; endl;</div>
<div class="line"><a id="l01074" name="l01074"></a><span class="lineno"> 1074</span>    <span class="keywordflow">while</span> (i &lt; sum) {</div>
<div class="line"><a id="l01075" name="l01075"></a><span class="lineno"> 1075</span>        <span class="keywordtype">int</span> num_space = clac_space(h, height);</div>
<div class="line"><a id="l01076" name="l01076"></a><span class="lineno"> 1076</span>        <span class="keywordflow">for</span> (<span class="keywordtype">int</span> k = 0; k &lt; num_space; k++) {</div>
<div class="line"><a id="l01077" name="l01077"></a><span class="lineno"> 1077</span>            os &lt;&lt; <span class="charliteral">&#39; &#39;</span>;</div>
<div class="line"><a id="l01078" name="l01078"></a><span class="lineno"> 1078</span>        }</div>
<div class="line"><a id="l01079" name="l01079"></a><span class="lineno"> 1079</span>        <span class="keywordflow">if</span> (vv[i] != space) {</div>
<div class="line"><a id="l01080" name="l01080"></a><span class="lineno"> 1080</span>            os &lt;&lt; vv[i];</div>
<div class="line"><a id="l01081" name="l01081"></a><span class="lineno"> 1081</span>        } <span class="keywordflow">else</span> {</div>
<div class="line"><a id="l01082" name="l01082"></a><span class="lineno"> 1082</span>            os &lt;&lt; <span class="charliteral">&#39;*&#39;</span>;</div>
<div class="line"><a id="l01083" name="l01083"></a><span class="lineno"> 1083</span>        }</div>
<div class="line"><a id="l01084" name="l01084"></a><span class="lineno"> 1084</span>        <span class="keywordflow">for</span> (<span class="keywordtype">int</span> k = 0; k &lt; num_space; k++) {</div>
<div class="line"><a id="l01085" name="l01085"></a><span class="lineno"> 1085</span>            os &lt;&lt; <span class="charliteral">&#39; &#39;</span>;</div>
<div class="line"><a id="l01086" name="l01086"></a><span class="lineno"> 1086</span>        }</div>
<div class="line"><a id="l01087" name="l01087"></a><span class="lineno"> 1087</span>        <span class="keyword">auto</span> it = <a class="code hl_function" href="classmy__binary__tree.html#a490bf7f8ebe87b6040b1294f73979fea">find</a>(sum_pow_of_2.begin(), sum_pow_of_2.end(), i + 1);</div>
<div class="line"><a id="l01088" name="l01088"></a><span class="lineno"> 1088</span>        <span class="keywordflow">if</span> (it != sum_pow_of_2.end()) {</div>
<div class="line"><a id="l01089" name="l01089"></a><span class="lineno"> 1089</span>            h++;</div>
<div class="line"><a id="l01090" name="l01090"></a><span class="lineno"> 1090</span>            os &lt;&lt; endl;</div>
<div class="line"><a id="l01091" name="l01091"></a><span class="lineno"> 1091</span>        }</div>
<div class="line"><a id="l01092" name="l01092"></a><span class="lineno"> 1092</span>        i++;</div>
<div class="line"><a id="l01093" name="l01093"></a><span class="lineno"> 1093</span>    }</div>
<div class="line"><a id="l01094" name="l01094"></a><span class="lineno"> 1094</span>    os &lt;&lt; <span class="stringliteral">&quot;--------------&quot;</span> &lt;&lt; endl;</div>
<div class="line"><a id="l01095" name="l01095"></a><span class="lineno"> 1095</span>    <span class="keywordflow">return</span> os;</div>
<div class="line"><a id="l01096" name="l01096"></a><span class="lineno"> 1096</span>}</div>
</div>
<div class="line"><a id="l01097" name="l01097"></a><span class="lineno"> 1097</span> </div>
<div class="line"><a id="l01098" name="l01098"></a><span class="lineno"> 1098</span> </div>
<div class="line"><a id="l01099" name="l01099"></a><span class="lineno"> 1099</span> </div>
<div class="line"><a id="l01100" name="l01100"></a><span class="lineno"> 1100</span> </div>
<div class="line"><a id="l01101" name="l01101"></a><span class="lineno"> 1101</span> </div>
<div class="line"><a id="l01102" name="l01102"></a><span class="lineno"> 1102</span> </div>
<div class="line"><a id="l01103" name="l01103"></a><span class="lineno"> 1103</span> </div>
<div class="line"><a id="l01104" name="l01104"></a><span class="lineno"> 1104</span> </div>
<div class="line"><a id="l01105" name="l01105"></a><span class="lineno"> 1105</span> </div>
<div class="line"><a id="l01106" name="l01106"></a><span class="lineno"> 1106</span> </div>
<div class="line"><a id="l01107" name="l01107"></a><span class="lineno"> 1107</span> </div>
<div class="line"><a id="l01108" name="l01108"></a><span class="lineno"> 1108</span> </div>
<div class="line"><a id="l01109" name="l01109"></a><span class="lineno"> 1109</span> </div>
<div class="line"><a id="l01110" name="l01110"></a><span class="lineno"> 1110</span> </div>
<div class="line"><a id="l01111" name="l01111"></a><span class="lineno"> 1111</span> </div>
<div class="line"><a id="l01112" name="l01112"></a><span class="lineno"> 1112</span></div>
<div class="line"><a id="l01118" name="l01118"></a><span class="lineno"> 1118</span><span class="keyword">template</span> &lt;<span class="keyword">typename</span> T&gt;</div>
<div class="foldopen" id="foldopen01119" data-start="{" data-end="};">
<div class="line"><a id="l01119" name="l01119"></a><span class="lineno"><a class="line" href="classmy__balence__binary__tree.html"> 1119</a></span><span class="keyword">class </span>my_balence_binary_tree:<span class="keyword">public</span> <a class="code hl_function" href="classmy__binary__tree.html#ae19ca02504d47a17836f0b0c533f8982">my_binary_tree</a>&lt;T&gt;{</div>
<div class="line"><a id="l01120" name="l01120"></a><span class="lineno"> 1120</span>    <span class="keyword">public</span>:</div>
<div class="line"><a id="l01121" name="l01121"></a><span class="lineno"> 1121</span>        my_balence_binary_tree(T val):<a class="code hl_function" href="classmy__binary__tree.html#ae19ca02504d47a17836f0b0c533f8982">my_binary_tree&lt;T&gt;</a>(val){</div>
<div class="line"><a id="l01122" name="l01122"></a><span class="lineno"> 1122</span>            this-&gt;<a class="code hl_variable" href="classmy__binary__tree.html#ae2d15edcaec6e5543a5e8c64ea0173cb">data</a>=val;</div>
<div class="line"><a id="l01123" name="l01123"></a><span class="lineno"> 1123</span>            this-&gt;<a class="code hl_variable" href="classmy__binary__tree.html#a69a6f187348e8b6219809620e784d3cf">left</a>=NULL;</div>
<div class="line"><a id="l01124" name="l01124"></a><span class="lineno"> 1124</span>            this-&gt;<a class="code hl_variable" href="classmy__binary__tree.html#a8910dc810a9a95fe4dc308eeef739b6a">right</a>=NULL;</div>
<div class="line"><a id="l01125" name="l01125"></a><span class="lineno"> 1125</span>        }</div>
<div class="line"><a id="l01126" name="l01126"></a><span class="lineno"> 1126</span>        ~my_balence_binary_tree(){</div>
<div class="line"><a id="l01127" name="l01127"></a><span class="lineno"> 1127</span>            <span class="keywordflow">if</span>(this-&gt;<a class="code hl_variable" href="classmy__binary__tree.html#a69a6f187348e8b6219809620e784d3cf">left</a>){</div>
<div class="line"><a id="l01128" name="l01128"></a><span class="lineno"> 1128</span>                <span class="keyword">delete</span> this-&gt;<a class="code hl_variable" href="classmy__binary__tree.html#a69a6f187348e8b6219809620e784d3cf">left</a>;          </div>
<div class="line"><a id="l01129" name="l01129"></a><span class="lineno"> 1129</span>            }</div>
<div class="line"><a id="l01130" name="l01130"></a><span class="lineno"> 1130</span>            <span class="keywordflow">if</span>(this-&gt;<a class="code hl_variable" href="classmy__binary__tree.html#a69a6f187348e8b6219809620e784d3cf">left</a>){</div>
<div class="line"><a id="l01131" name="l01131"></a><span class="lineno"> 1131</span>                <span class="keyword">delete</span> this-&gt;<a class="code hl_variable" href="classmy__binary__tree.html#a8910dc810a9a95fe4dc308eeef739b6a">right</a>;</div>
<div class="line"><a id="l01132" name="l01132"></a><span class="lineno"> 1132</span>            } </div>
<div class="line"><a id="l01133" name="l01133"></a><span class="lineno"> 1133</span>        }</div>
<div class="line"><a id="l01134" name="l01134"></a><span class="lineno"> 1134</span>};</div>
</div>
<div class="line"><a id="l01135" name="l01135"></a><span class="lineno"> 1135</span> </div>
<div class="line"><a id="l01136" name="l01136"></a><span class="lineno"> 1136</span> </div>
<div class="line"><a id="l01137" name="l01137"></a><span class="lineno"> 1137</span> </div>
<div class="line"><a id="l01138" name="l01138"></a><span class="lineno"> 1138</span> </div>
<div class="line"><a id="l01139" name="l01139"></a><span class="lineno"> 1139</span> </div>
<div class="line"><a id="l01140" name="l01140"></a><span class="lineno"> 1140</span> </div>
<div class="line"><a id="l01141" name="l01141"></a><span class="lineno"> 1141</span></div>
<div class="line"><a id="l01147" name="l01147"></a><span class="lineno"> 1147</span><span class="keyword">template</span> &lt;<span class="keyword">typename</span> T&gt;</div>
<div class="foldopen" id="foldopen01148" data-start="{" data-end="};">
<div class="line"><a id="l01148" name="l01148"></a><span class="lineno"><a class="line" href="classmy__binary__search__tree.html"> 1148</a></span><span class="keyword">class </span>my_binary_search_tree:<span class="keyword">public</span> <a class="code hl_function" href="classmy__binary__tree.html#ae19ca02504d47a17836f0b0c533f8982">my_binary_tree</a>&lt;T&gt;{</div>
<div class="line"><a id="l01149" name="l01149"></a><span class="lineno"> 1149</span>    <span class="keyword">public</span>:</div>
<div class="line"><a id="l01150" name="l01150"></a><span class="lineno"> 1150</span>        my_binary_search_tree(T val):<a class="code hl_function" href="classmy__binary__tree.html#ae19ca02504d47a17836f0b0c533f8982">my_binary_tree&lt;T&gt;</a>(val){</div>
<div class="line"><a id="l01151" name="l01151"></a><span class="lineno"> 1151</span>            this-&gt;<a class="code hl_variable" href="classmy__binary__tree.html#ae2d15edcaec6e5543a5e8c64ea0173cb">data</a>=val;</div>
<div class="line"><a id="l01152" name="l01152"></a><span class="lineno"> 1152</span>            this-&gt;<a class="code hl_variable" href="classmy__binary__tree.html#a69a6f187348e8b6219809620e784d3cf">left</a>=NULL;</div>
<div class="line"><a id="l01153" name="l01153"></a><span class="lineno"> 1153</span>            this-&gt;<a class="code hl_variable" href="classmy__binary__tree.html#a8910dc810a9a95fe4dc308eeef739b6a">right</a>=NULL;</div>
<div class="line"><a id="l01154" name="l01154"></a><span class="lineno"> 1154</span>        }</div>
<div class="line"><a id="l01155" name="l01155"></a><span class="lineno"> 1155</span>        ~my_binary_search_tree(){</div>
<div class="line"><a id="l01156" name="l01156"></a><span class="lineno"> 1156</span>            <span class="keywordflow">if</span>(this-&gt;<a class="code hl_variable" href="classmy__binary__tree.html#a69a6f187348e8b6219809620e784d3cf">left</a>){</div>
<div class="line"><a id="l01157" name="l01157"></a><span class="lineno"> 1157</span>                <span class="keyword">delete</span> this-&gt;<a class="code hl_variable" href="classmy__binary__tree.html#a69a6f187348e8b6219809620e784d3cf">left</a>;          </div>
<div class="line"><a id="l01158" name="l01158"></a><span class="lineno"> 1158</span>            }</div>
<div class="line"><a id="l01159" name="l01159"></a><span class="lineno"> 1159</span>            <span class="keywordflow">if</span>(this-&gt;<a class="code hl_variable" href="classmy__binary__tree.html#a69a6f187348e8b6219809620e784d3cf">left</a>){</div>
<div class="line"><a id="l01160" name="l01160"></a><span class="lineno"> 1160</span>                <span class="keyword">delete</span> this-&gt;<a class="code hl_variable" href="classmy__binary__tree.html#a8910dc810a9a95fe4dc308eeef739b6a">right</a>;</div>
<div class="line"><a id="l01161" name="l01161"></a><span class="lineno"> 1161</span>            } </div>
<div class="line"><a id="l01162" name="l01162"></a><span class="lineno"> 1162</span>        }</div>
<div class="line"><a id="l01163" name="l01163"></a><span class="lineno"> 1163</span>};</div>
</div>
<div class="line"><a id="l01164" name="l01164"></a><span class="lineno"> 1164</span> </div>
<div class="line"><a id="l01165" name="l01165"></a><span class="lineno"> 1165</span> </div>
<div class="line"><a id="l01166" name="l01166"></a><span class="lineno"> 1166</span> </div>
<div class="line"><a id="l01167" name="l01167"></a><span class="lineno"> 1167</span> </div>
<div class="line"><a id="l01168" name="l01168"></a><span class="lineno"> 1168</span> </div>
<div class="line"><a id="l01169" name="l01169"></a><span class="lineno"> 1169</span></div>
<div class="line"><a id="l01175" name="l01175"></a><span class="lineno"> 1175</span><span class="keyword">template</span> &lt;<span class="keyword">typename</span> T&gt;</div>
<div class="foldopen" id="foldopen01176" data-start="{" data-end="};">
<div class="line"><a id="l01176" name="l01176"></a><span class="lineno"><a class="line" href="classmy__complete__binary__tree.html"> 1176</a></span><span class="keyword">class </span>my_complete_binary_tree:<span class="keyword">public</span> <a class="code hl_function" href="classmy__binary__tree.html#ae19ca02504d47a17836f0b0c533f8982">my_binary_tree</a>&lt;T&gt;{</div>
<div class="line"><a id="l01177" name="l01177"></a><span class="lineno"> 1177</span>    <span class="keyword">public</span>:</div>
<div class="line"><a id="l01178" name="l01178"></a><span class="lineno"> 1178</span>        my_complete_binary_tree(T val):<a class="code hl_function" href="classmy__binary__tree.html#ae19ca02504d47a17836f0b0c533f8982">my_binary_tree&lt;T&gt;</a>(val){</div>
<div class="line"><a id="l01179" name="l01179"></a><span class="lineno"> 1179</span>            this-&gt;<a class="code hl_variable" href="classmy__binary__tree.html#ae2d15edcaec6e5543a5e8c64ea0173cb">data</a>=val;</div>
<div class="line"><a id="l01180" name="l01180"></a><span class="lineno"> 1180</span>            this-&gt;<a class="code hl_variable" href="classmy__binary__tree.html#a69a6f187348e8b6219809620e784d3cf">left</a>=NULL;</div>
<div class="line"><a id="l01181" name="l01181"></a><span class="lineno"> 1181</span>            this-&gt;<a class="code hl_variable" href="classmy__binary__tree.html#a8910dc810a9a95fe4dc308eeef739b6a">right</a>=NULL;</div>
<div class="line"><a id="l01182" name="l01182"></a><span class="lineno"> 1182</span>        }</div>
<div class="line"><a id="l01183" name="l01183"></a><span class="lineno"> 1183</span>        ~my_complete_binary_tree(){</div>
<div class="line"><a id="l01184" name="l01184"></a><span class="lineno"> 1184</span>            <span class="keywordflow">if</span>(this-&gt;<a class="code hl_variable" href="classmy__binary__tree.html#a69a6f187348e8b6219809620e784d3cf">left</a>){</div>
<div class="line"><a id="l01185" name="l01185"></a><span class="lineno"> 1185</span>                <span class="keyword">delete</span> this-&gt;<a class="code hl_variable" href="classmy__binary__tree.html#a69a6f187348e8b6219809620e784d3cf">left</a>;          </div>
<div class="line"><a id="l01186" name="l01186"></a><span class="lineno"> 1186</span>            }</div>
<div class="line"><a id="l01187" name="l01187"></a><span class="lineno"> 1187</span>            <span class="keywordflow">if</span>(this-&gt;<a class="code hl_variable" href="classmy__binary__tree.html#a69a6f187348e8b6219809620e784d3cf">left</a>){</div>
<div class="line"><a id="l01188" name="l01188"></a><span class="lineno"> 1188</span>                <span class="keyword">delete</span> this-&gt;<a class="code hl_variable" href="classmy__binary__tree.html#a8910dc810a9a95fe4dc308eeef739b6a">right</a>;</div>
<div class="line"><a id="l01189" name="l01189"></a><span class="lineno"> 1189</span>            } </div>
<div class="line"><a id="l01190" name="l01190"></a><span class="lineno"> 1190</span>        }</div>
<div class="line"><a id="l01191" name="l01191"></a><span class="lineno"> 1191</span>    </div>
<div class="line"><a id="l01192" name="l01192"></a><span class="lineno"> 1192</span>};</div>
</div>
<div class="line"><a id="l01193" name="l01193"></a><span class="lineno"> 1193</span> </div>
<div class="line"><a id="l01194" name="l01194"></a><span class="lineno"> 1194</span></div>
<div class="line"><a id="l01200" name="l01200"></a><span class="lineno"> 1200</span><span class="keyword">template</span> &lt;<span class="keyword">typename</span> T&gt;</div>
<div class="foldopen" id="foldopen01201" data-start="{" data-end="};">
<div class="line"><a id="l01201" name="l01201"></a><span class="lineno"><a class="line" href="classmy__full__binary__tree.html"> 1201</a></span><span class="keyword">class </span>my_full_binary_tree:<span class="keyword">public</span> <a class="code hl_function" href="classmy__binary__tree.html#ae19ca02504d47a17836f0b0c533f8982">my_binary_tree</a>&lt;T&gt;{    </div>
<div class="line"><a id="l01202" name="l01202"></a><span class="lineno"> 1202</span>    <span class="keyword">public</span>:</div>
<div class="line"><a id="l01203" name="l01203"></a><span class="lineno"> 1203</span>        my_full_binary_tree(T val):<a class="code hl_function" href="classmy__binary__tree.html#ae19ca02504d47a17836f0b0c533f8982">my_binary_tree&lt;T&gt;</a>(val) {</div>
<div class="line"><a id="l01204" name="l01204"></a><span class="lineno"> 1204</span>            this-&gt;<a class="code hl_variable" href="classmy__binary__tree.html#ae2d15edcaec6e5543a5e8c64ea0173cb">data</a>=val;</div>
<div class="line"><a id="l01205" name="l01205"></a><span class="lineno"> 1205</span>            this-&gt;<a class="code hl_variable" href="classmy__binary__tree.html#a69a6f187348e8b6219809620e784d3cf">left</a>=NULL;</div>
<div class="line"><a id="l01206" name="l01206"></a><span class="lineno"> 1206</span>            this-&gt;<a class="code hl_variable" href="classmy__binary__tree.html#a8910dc810a9a95fe4dc308eeef739b6a">right</a>=NULL;</div>
<div class="line"><a id="l01207" name="l01207"></a><span class="lineno"> 1207</span>        }</div>
<div class="line"><a id="l01208" name="l01208"></a><span class="lineno"> 1208</span>        ~my_full_binary_tree(){</div>
<div class="line"><a id="l01209" name="l01209"></a><span class="lineno"> 1209</span>            <span class="keywordflow">if</span>(this-&gt;<a class="code hl_variable" href="classmy__binary__tree.html#a69a6f187348e8b6219809620e784d3cf">left</a>){</div>
<div class="line"><a id="l01210" name="l01210"></a><span class="lineno"> 1210</span>                <span class="keyword">delete</span> this-&gt;<a class="code hl_variable" href="classmy__binary__tree.html#a69a6f187348e8b6219809620e784d3cf">left</a>;          </div>
<div class="line"><a id="l01211" name="l01211"></a><span class="lineno"> 1211</span>            }</div>
<div class="line"><a id="l01212" name="l01212"></a><span class="lineno"> 1212</span>            <span class="keywordflow">if</span>(this-&gt;<a class="code hl_variable" href="classmy__binary__tree.html#a69a6f187348e8b6219809620e784d3cf">left</a>){</div>
<div class="line"><a id="l01213" name="l01213"></a><span class="lineno"> 1213</span>                <span class="keyword">delete</span> this-&gt;<a class="code hl_variable" href="classmy__binary__tree.html#a8910dc810a9a95fe4dc308eeef739b6a">right</a>;</div>
<div class="line"><a id="l01214" name="l01214"></a><span class="lineno"> 1214</span>            } </div>
<div class="line"><a id="l01215" name="l01215"></a><span class="lineno"> 1215</span>        }</div>
<div class="line"><a id="l01216" name="l01216"></a><span class="lineno"> 1216</span>    </div>
<div class="line"><a id="l01224" name="l01224"></a><span class="lineno"> 1224</span>        my_full_binary_tree&lt;T&gt;* <a class="code hl_function" href="classmy__full__binary__tree.html#abc576874d3f353e19c3e4ef154b6c039">construct_full_binary_tree</a>(vector&lt;T&gt; values, <span class="keywordtype">int</span> index);</div>
<div class="line"><a id="l01225" name="l01225"></a><span class="lineno"> 1225</span>    </div>
<div class="line"><a id="l01226" name="l01226"></a><span class="lineno"> 1226</span>        </div>
<div class="line"><a id="l01227" name="l01227"></a><span class="lineno"> 1227</span>};</div>
</div>
<div class="line"><a id="l01228" name="l01228"></a><span class="lineno"> 1228</span><span class="comment">// 层先法构造满二叉树的函数</span></div>
<div class="line"><a id="l01229" name="l01229"></a><span class="lineno"> 1229</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T&gt;</div>
<div class="foldopen" id="foldopen01230" data-start="{" data-end="}">
<div class="line"><a id="l01230" name="l01230"></a><span class="lineno"><a class="line" href="classmy__full__binary__tree.html#abc576874d3f353e19c3e4ef154b6c039"> 1230</a></span>my_full_binary_tree&lt;T&gt;* <a class="code hl_function" href="classmy__full__binary__tree.html#abc576874d3f353e19c3e4ef154b6c039">my_full_binary_tree&lt;T&gt;::construct_full_binary_tree</a>(vector&lt;T&gt; values, <span class="keywordtype">int</span> index) {</div>
<div class="line"><a id="l01231" name="l01231"></a><span class="lineno"> 1231</span>    <span class="keywordflow">if</span> (index &gt;= values.size()) {</div>
<div class="line"><a id="l01232" name="l01232"></a><span class="lineno"> 1232</span>        <span class="keywordflow">return</span> NULL;</div>
<div class="line"><a id="l01233" name="l01233"></a><span class="lineno"> 1233</span>    }</div>
<div class="line"><a id="l01234" name="l01234"></a><span class="lineno"> 1234</span>    my_full_binary_tree&lt;T&gt;* node = <span class="keyword">new</span> my_full_binary_tree(values[index]);</div>
<div class="line"><a id="l01235" name="l01235"></a><span class="lineno"> 1235</span>    node-&gt;<a class="code hl_variable" href="classmy__binary__tree.html#a69a6f187348e8b6219809620e784d3cf">left</a> = <a class="code hl_function" href="classmy__full__binary__tree.html#abc576874d3f353e19c3e4ef154b6c039">construct_full_binary_tree</a>(values, 2 * index + 1);</div>
<div class="line"><a id="l01236" name="l01236"></a><span class="lineno"> 1236</span>    node-&gt;<a class="code hl_variable" href="classmy__binary__tree.html#a8910dc810a9a95fe4dc308eeef739b6a">right</a> = <a class="code hl_function" href="classmy__full__binary__tree.html#abc576874d3f353e19c3e4ef154b6c039">construct_full_binary_tree</a>(values, 2 * index + 2);</div>
<div class="line"><a id="l01237" name="l01237"></a><span class="lineno"> 1237</span>    <span class="keywordflow">return</span> node;</div>
<div class="line"><a id="l01238" name="l01238"></a><span class="lineno"> 1238</span>}</div>
</div>
<div class="line"><a id="l01239" name="l01239"></a><span class="lineno"> 1239</span> </div>
<div class="line"><a id="l01240" name="l01240"></a><span class="lineno"> 1240</span> </div>
<div class="line"><a id="l01241" name="l01241"></a><span class="lineno"> 1241</span></div>
<div class="line"><a id="l01247" name="l01247"></a><span class="lineno"> 1247</span><span class="keyword">template</span> &lt;<span class="keyword">typename</span> T&gt;</div>
<div class="foldopen" id="foldopen01248" data-start="{" data-end="};">
<div class="line"><a id="l01248" name="l01248"></a><span class="lineno"><a class="line" href="classmy__binary__heap__tree.html"> 1248</a></span><span class="keyword">class </span>my_binary_heap_tree:<span class="keyword">public</span> <a class="code hl_function" href="classmy__binary__tree.html#ae19ca02504d47a17836f0b0c533f8982">my_binary_tree</a>&lt;T&gt;{</div>
<div class="line"><a id="l01249" name="l01249"></a><span class="lineno"> 1249</span>    <span class="keyword">public</span>:</div>
<div class="line"><a id="l01250" name="l01250"></a><span class="lineno"> 1250</span>        my_binary_heap_tree(T val):<a class="code hl_function" href="classmy__binary__tree.html#ae19ca02504d47a17836f0b0c533f8982">my_binary_tree&lt;T&gt;</a>(val){</div>
<div class="line"><a id="l01251" name="l01251"></a><span class="lineno"> 1251</span>            this-&gt;<a class="code hl_variable" href="classmy__binary__tree.html#ae2d15edcaec6e5543a5e8c64ea0173cb">data</a>=val;</div>
<div class="line"><a id="l01252" name="l01252"></a><span class="lineno"> 1252</span>            this-&gt;<a class="code hl_variable" href="classmy__binary__tree.html#a69a6f187348e8b6219809620e784d3cf">left</a>=NULL;</div>
<div class="line"><a id="l01253" name="l01253"></a><span class="lineno"> 1253</span>            this-&gt;<a class="code hl_variable" href="classmy__binary__tree.html#a8910dc810a9a95fe4dc308eeef739b6a">right</a>=NULL;</div>
<div class="line"><a id="l01254" name="l01254"></a><span class="lineno"> 1254</span>        }</div>
<div class="line"><a id="l01255" name="l01255"></a><span class="lineno"> 1255</span>        ~my_binary_heap_tree(){</div>
<div class="line"><a id="l01256" name="l01256"></a><span class="lineno"> 1256</span>            <span class="keywordflow">if</span>(this-&gt;<a class="code hl_variable" href="classmy__binary__tree.html#a69a6f187348e8b6219809620e784d3cf">left</a>){</div>
<div class="line"><a id="l01257" name="l01257"></a><span class="lineno"> 1257</span>                <span class="keyword">delete</span> this-&gt;<a class="code hl_variable" href="classmy__binary__tree.html#a69a6f187348e8b6219809620e784d3cf">left</a>;          </div>
<div class="line"><a id="l01258" name="l01258"></a><span class="lineno"> 1258</span>            }</div>
<div class="line"><a id="l01259" name="l01259"></a><span class="lineno"> 1259</span>            <span class="keywordflow">if</span>(this-&gt;<a class="code hl_variable" href="classmy__binary__tree.html#a69a6f187348e8b6219809620e784d3cf">left</a>){</div>
<div class="line"><a id="l01260" name="l01260"></a><span class="lineno"> 1260</span>                <span class="keyword">delete</span> this-&gt;<a class="code hl_variable" href="classmy__binary__tree.html#a8910dc810a9a95fe4dc308eeef739b6a">right</a>;</div>
<div class="line"><a id="l01261" name="l01261"></a><span class="lineno"> 1261</span>            } </div>
<div class="line"><a id="l01262" name="l01262"></a><span class="lineno"> 1262</span>        }</div>
<div class="line"><a id="l01263" name="l01263"></a><span class="lineno"> 1263</span>};</div>
</div>
<div class="line"><a id="l01264" name="l01264"></a><span class="lineno"> 1264</span> </div>
<div class="line"><a id="l01265" name="l01265"></a><span class="lineno"> 1265</span> </div>
<div class="line"><a id="l01266" name="l01266"></a><span class="lineno"> 1266</span> </div>
<div class="line"><a id="l01267" name="l01267"></a><span class="lineno"> 1267</span> </div>
<div class="line"><a id="l01268" name="l01268"></a><span class="lineno"> 1268</span></div>
<div class="line"><a id="l01274" name="l01274"></a><span class="lineno"> 1274</span><span class="keyword">template</span> &lt;<span class="keyword">typename</span> T&gt;</div>
<div class="foldopen" id="foldopen01275" data-start="{" data-end="};">
<div class="line"><a id="l01275" name="l01275"></a><span class="lineno"><a class="line" href="classmy___huffman__binary__tree.html"> 1275</a></span><span class="keyword">class </span>my_Huffman_binary_tree:<span class="keyword">public</span> <a class="code hl_function" href="classmy__binary__tree.html#ae19ca02504d47a17836f0b0c533f8982">my_binary_tree</a>&lt;T&gt;{</div>
<div class="line"><a id="l01276" name="l01276"></a><span class="lineno"> 1276</span>    <span class="keyword">public</span>:</div>
<div class="line"><a id="l01277" name="l01277"></a><span class="lineno"> 1277</span>        my_Huffman_binary_tree(T val):<a class="code hl_function" href="classmy__binary__tree.html#ae19ca02504d47a17836f0b0c533f8982">my_binary_tree&lt;T&gt;</a>(val){</div>
<div class="line"><a id="l01278" name="l01278"></a><span class="lineno"> 1278</span>            this-&gt;<a class="code hl_variable" href="classmy__binary__tree.html#ae2d15edcaec6e5543a5e8c64ea0173cb">data</a>=val;</div>
<div class="line"><a id="l01279" name="l01279"></a><span class="lineno"> 1279</span>            this-&gt;<a class="code hl_variable" href="classmy__binary__tree.html#a69a6f187348e8b6219809620e784d3cf">left</a>=NULL;</div>
<div class="line"><a id="l01280" name="l01280"></a><span class="lineno"> 1280</span>            this-&gt;<a class="code hl_variable" href="classmy__binary__tree.html#a8910dc810a9a95fe4dc308eeef739b6a">right</a>=NULL;</div>
<div class="line"><a id="l01281" name="l01281"></a><span class="lineno"> 1281</span>        }</div>
<div class="line"><a id="l01282" name="l01282"></a><span class="lineno"> 1282</span>        ~my_Huffman_binary_tree(){</div>
<div class="line"><a id="l01283" name="l01283"></a><span class="lineno"> 1283</span>            <span class="keywordflow">if</span>(this-&gt;<a class="code hl_variable" href="classmy__binary__tree.html#a69a6f187348e8b6219809620e784d3cf">left</a>){</div>
<div class="line"><a id="l01284" name="l01284"></a><span class="lineno"> 1284</span>                <span class="keyword">delete</span> this-&gt;<a class="code hl_variable" href="classmy__binary__tree.html#a69a6f187348e8b6219809620e784d3cf">left</a>;          </div>
<div class="line"><a id="l01285" name="l01285"></a><span class="lineno"> 1285</span>            }</div>
<div class="line"><a id="l01286" name="l01286"></a><span class="lineno"> 1286</span>            <span class="keywordflow">if</span>(this-&gt;<a class="code hl_variable" href="classmy__binary__tree.html#a69a6f187348e8b6219809620e784d3cf">left</a>){</div>
<div class="line"><a id="l01287" name="l01287"></a><span class="lineno"> 1287</span>                <span class="keyword">delete</span> this-&gt;<a class="code hl_variable" href="classmy__binary__tree.html#a8910dc810a9a95fe4dc308eeef739b6a">right</a>;</div>
<div class="line"><a id="l01288" name="l01288"></a><span class="lineno"> 1288</span>            } </div>
<div class="line"><a id="l01289" name="l01289"></a><span class="lineno"> 1289</span>        }</div>
<div class="line"><a id="l01290" name="l01290"></a><span class="lineno"> 1290</span>};</div>
</div>
<div class="line"><a id="l01291" name="l01291"></a><span class="lineno"> 1291</span> </div>
<div class="ttc" id="aclassmy__binary__search__tree_html"><div class="ttname"><a href="classmy__binary__search__tree.html">my_binary_search_tree</a></div><div class="ttdoc">二叉排序树类（模板类，支持任意数据类型T）</div><div class="ttdef"><b>Definition</b> my_tree.h:1148</div></div>
<div class="ttc" id="aclassmy__binary__tree_html"><div class="ttname"><a href="classmy__binary__tree.html">my_binary_tree</a></div><div class="ttdoc">二叉树类（模板类，支持任意数据类型T）</div><div class="ttdef"><b>Definition</b> my_tree.h:144</div></div>
<div class="ttc" id="aclassmy__binary__tree_html_a047c1a5b1fb76a0cb62700eb1c53bb8b"><div class="ttname"><a href="classmy__binary__tree.html#a047c1a5b1fb76a0cb62700eb1c53bb8b">my_binary_tree::get_height</a></div><div class="ttdeci">int get_height()</div><div class="ttdoc">计算二叉树的高度</div><div class="ttdef"><b>Definition</b> my_tree.h:514</div></div>
<div class="ttc" id="aclassmy__binary__tree_html_a05b6069959ff87dc7824ce4e05db024a"><div class="ttname"><a href="classmy__binary__tree.html#a05b6069959ff87dc7824ce4e05db024a">my_binary_tree::get_value</a></div><div class="ttdeci">T get_value()</div><div class="ttdoc">打印当前节点的数据值</div><div class="ttdef"><b>Definition</b> my_tree.h:484</div></div>
<div class="ttc" id="aclassmy__binary__tree_html_a19f020b91ef749755745ac08d69be0b6"><div class="ttname"><a href="classmy__binary__tree.html#a19f020b91ef749755745ac08d69be0b6">my_binary_tree::copy</a></div><div class="ttdeci">void copy(my_binary_tree&lt; T &gt; *des, my_binary_tree&lt; T &gt; *src)</div><div class="ttdoc">复制二叉树（从src拷贝到des）</div><div class="ttdef"><b>Definition</b> my_tree.h:689</div></div>
<div class="ttc" id="aclassmy__binary__tree_html_a24a14198a85ebfd603f5284ef9940e41"><div class="ttname"><a href="classmy__binary__tree.html#a24a14198a85ebfd603f5284ef9940e41">my_binary_tree::delete_point</a></div><div class="ttdeci">void delete_point(my_binary_tree&lt; T &gt; *point)</div><div class="ttdoc">删除节点（未实现）</div><div class="ttdef"><b>Definition</b> my_tree.h:724</div></div>
<div class="ttc" id="aclassmy__binary__tree_html_a35c9081b6b3dfe457c8d29697ccfdfb1"><div class="ttname"><a href="classmy__binary__tree.html#a35c9081b6b3dfe457c8d29697ccfdfb1">my_binary_tree::is_balence_binary_tree</a></div><div class="ttdeci">bool is_balence_binary_tree()</div><div class="ttdoc">判断二叉树是否为平衡二叉树（左右子树高度差不超过1）</div><div class="ttdef"><b>Definition</b> my_tree.h:658</div></div>
<div class="ttc" id="aclassmy__binary__tree_html_a3b473ee42358d2ecda1958b1b72fd1dd"><div class="ttname"><a href="classmy__binary__tree.html#a3b473ee42358d2ecda1958b1b72fd1dd">my_binary_tree::show_binary_tree</a></div><div class="ttdeci">void show_binary_tree(string mode)</div><div class="ttdoc">遍历二叉树并打印节点值</div><div class="ttdef"><b>Definition</b> my_tree.h:865</div></div>
<div class="ttc" id="aclassmy__binary__tree_html_a488bf2adcd7de91b9e259f6ef8c7762b"><div class="ttname"><a href="classmy__binary__tree.html#a488bf2adcd7de91b9e259f6ef8c7762b">my_binary_tree::construct_binary_tree</a></div><div class="ttdeci">my_binary_tree&lt; T &gt; * construct_binary_tree(vector&lt; T &gt; values, int index, T space)</div><div class="ttdoc">层先法构造普通二叉树（支持空节点）</div><div class="ttdef"><b>Definition</b> my_tree.h:449</div></div>
<div class="ttc" id="aclassmy__binary__tree_html_a490bf7f8ebe87b6040b1294f73979fea"><div class="ttname"><a href="classmy__binary__tree.html#a490bf7f8ebe87b6040b1294f73979fea">my_binary_tree::find</a></div><div class="ttdeci">my_binary_tree&lt; T &gt; * find(int val)</div><div class="ttdoc">查找值为val的节点</div><div class="ttdef"><b>Definition</b> my_tree.h:615</div></div>
<div class="ttc" id="aclassmy__binary__tree_html_a4a4f092d8f75d1f8840db3c3b4b6f36e"><div class="ttname"><a href="classmy__binary__tree.html#a4a4f092d8f75d1f8840db3c3b4b6f36e">my_binary_tree::traversal_binary_tree</a></div><div class="ttdeci">Function traversal_binary_tree(string mode, Function F)</div><div class="ttdoc">遍历二叉树并执行自定义函数（无空节点处理）</div><div class="ttdef"><b>Definition</b> my_tree.h:909</div></div>
<div class="ttc" id="aclassmy__binary__tree_html_a52db051eb0ccae70e61baf638acd2f81"><div class="ttname"><a href="classmy__binary__tree.html#a52db051eb0ccae70e61baf638acd2f81">my_binary_tree::operator[]</a></div><div class="ttdeci">T operator[](int index)</div><div class="ttdoc">索引运算符重载</div><div class="ttdef"><b>Definition</b> my_tree.h:434</div></div>
<div class="ttc" id="aclassmy__binary__tree_html_a57bcf0e8e11dcb2db4d3c2b72e62d913"><div class="ttname"><a href="classmy__binary__tree.html#a57bcf0e8e11dcb2db4d3c2b72e62d913">my_binary_tree::operator!=</a></div><div class="ttdeci">friend bool operator!=(my_binary_tree&lt; T &gt; lhs, my_binary_tree&lt; T &gt; rhs)</div><div class="ttdoc">不等运算符重载</div><div class="ttdef"><b>Definition</b> my_tree.h:1056</div></div>
<div class="ttc" id="aclassmy__binary__tree_html_a5842011f1564adb291d8a62f1f7e7625"><div class="ttname"><a href="classmy__binary__tree.html#a5842011f1564adb291d8a62f1f7e7625">my_binary_tree::revolve</a></div><div class="ttdeci">my_binary_tree&lt; T &gt; * revolve(string mode)</div><div class="ttdoc">旋转二叉树（未实现）</div><div class="ttdef"><b>Definition</b> my_tree.h:761</div></div>
<div class="ttc" id="aclassmy__binary__tree_html_a5fe4fbbeb0729ef67cc258d2a5350860"><div class="ttname"><a href="classmy__binary__tree.html#a5fe4fbbeb0729ef67cc258d2a5350860">my_binary_tree::delete_pos</a></div><div class="ttdeci">void delete_pos(string position)</div><div class="ttdoc">删除节点（未实现）</div><div class="ttdef"><b>Definition</b> my_tree.h:741</div></div>
<div class="ttc" id="aclassmy__binary__tree_html_a69a6f187348e8b6219809620e784d3cf"><div class="ttname"><a href="classmy__binary__tree.html#a69a6f187348e8b6219809620e784d3cf">my_binary_tree::left</a></div><div class="ttdeci">my_binary_tree&lt; T &gt; * left</div><div class="ttdoc">左子树指针</div><div class="ttdef"><b>Definition</b> my_tree.h:147</div></div>
<div class="ttc" id="aclassmy__binary__tree_html_a6f45e4cb6774b092b40bee77ee80b757"><div class="ttname"><a href="classmy__binary__tree.html#a6f45e4cb6774b092b40bee77ee80b757">my_binary_tree::mirror</a></div><div class="ttdeci">void mirror()</div><div class="ttdoc">二叉树镜像（交换所有节点的左右子树）</div><div class="ttdef"><b>Definition</b> my_tree.h:468</div></div>
<div class="ttc" id="aclassmy__binary__tree_html_a6faf690077dab82f4d1f72920c3834fd"><div class="ttname"><a href="classmy__binary__tree.html#a6faf690077dab82f4d1f72920c3834fd">my_binary_tree::my_binary_tree</a></div><div class="ttdeci">my_binary_tree(const my_binary_tree&lt; T &gt; &amp;other)</div><div class="ttdoc">拷贝构造函数（深拷贝）</div><div class="ttdef"><b>Definition</b> my_tree.h:164</div></div>
<div class="ttc" id="aclassmy__binary__tree_html_a76f83530b098d7ad84262d21c885c15d"><div class="ttname"><a href="classmy__binary__tree.html#a76f83530b098d7ad84262d21c885c15d">my_binary_tree::get_last_layer_nodes</a></div><div class="ttdeci">int get_last_layer_nodes()</div><div class="ttdoc">计算最后一层（叶子节点层）的节点总数</div><div class="ttdef"><b>Definition</b> my_tree.h:561</div></div>
<div class="ttc" id="aclassmy__binary__tree_html_a8910dc810a9a95fe4dc308eeef739b6a"><div class="ttname"><a href="classmy__binary__tree.html#a8910dc810a9a95fe4dc308eeef739b6a">my_binary_tree::right</a></div><div class="ttdeci">my_binary_tree&lt; T &gt; * right</div><div class="ttdoc">右子树指针</div><div class="ttdef"><b>Definition</b> my_tree.h:148</div></div>
<div class="ttc" id="aclassmy__binary__tree_html_a8fc393aceaa7e46fc5fb6b9377c12ea3"><div class="ttname"><a href="classmy__binary__tree.html#a8fc393aceaa7e46fc5fb6b9377c12ea3">my_binary_tree::is_empty</a></div><div class="ttdeci">bool is_empty()</div><div class="ttdoc">判断二叉树是否为空</div><div class="ttdef"><b>Definition</b> my_tree.h:478</div></div>
<div class="ttc" id="aclassmy__binary__tree_html_a9279b204f13b6f6e79646fe38387607a"><div class="ttname"><a href="classmy__binary__tree.html#a9279b204f13b6f6e79646fe38387607a">my_binary_tree::get_lrest_leave</a></div><div class="ttdeci">my_binary_tree&lt; T &gt; * get_lrest_leave(string l_or_r)</div><div class="ttdoc">获取最左或最右的叶子节点</div><div class="ttdef"><b>Definition</b> my_tree.h:579</div></div>
<div class="ttc" id="aclassmy__binary__tree_html_a9675071237ce43751138c4fa3ef43657"><div class="ttname"><a href="classmy__binary__tree.html#a9675071237ce43751138c4fa3ef43657">my_binary_tree::insert</a></div><div class="ttdeci">void insert(T val, string position)</div><div class="ttdoc">插入节点（未实现）</div><div class="ttdef"><b>Definition</b> my_tree.h:697</div></div>
<div class="ttc" id="aclassmy__binary__tree_html_a9b5581a82079878a7faac62d07bbcc12"><div class="ttname"><a href="classmy__binary__tree.html#a9b5581a82079878a7faac62d07bbcc12">my_binary_tree::operator==</a></div><div class="ttdeci">friend bool operator==(my_binary_tree&lt; T &gt; lhs, my_binary_tree&lt; T &gt; rhs)</div><div class="ttdoc">相等运算符重载（判断两棵树是否完全相同）</div><div class="ttdef"><b>Definition</b> my_tree.h:1040</div></div>
<div class="ttc" id="aclassmy__binary__tree_html_a9b9d88b02caf22fc6de3a78e3a514816"><div class="ttname"><a href="classmy__binary__tree.html#a9b9d88b02caf22fc6de3a78e3a514816">my_binary_tree::operator&lt;&lt;</a></div><div class="ttdeci">friend ostream &amp; operator&lt;&lt;(ostream &amp;os, my_binary_tree&lt; T &gt; p)</div><div class="ttdoc">输出运算符重载（格式化打印二叉树）</div><div class="ttdef"><b>Definition</b> my_tree.h:1061</div></div>
<div class="ttc" id="aclassmy__binary__tree_html_aa23b0dbc0a4f4f7741111867f6d8b2e9"><div class="ttname"><a href="classmy__binary__tree.html#aa23b0dbc0a4f4f7741111867f6d8b2e9">my_binary_tree::append</a></div><div class="ttdeci">void append(my_binary_tree&lt; T &gt; *another_tree, string l_or_r)</div><div class="ttdoc">向当前节点追加左/右子树</div><div class="ttdef"><b>Definition</b> my_tree.h:674</div></div>
<div class="ttc" id="aclassmy__binary__tree_html_aa65e9e0bae93b835e20c32de429928d3"><div class="ttname"><a href="classmy__binary__tree.html#aa65e9e0bae93b835e20c32de429928d3">my_binary_tree::print_to_vector</a></div><div class="ttdeci">void print_to_vector(vector&lt; T &gt; &amp;vv)</div><div class="ttdoc">层序遍历二叉树，将节点值存入向量（空节点用占位符）</div><div class="ttdef"><b>Definition</b> my_tree.h:1033</div></div>
<div class="ttc" id="aclassmy__binary__tree_html_aabd378c4f70ed8c8e76691769d111c59"><div class="ttname"><a href="classmy__binary__tree.html#aabd378c4f70ed8c8e76691769d111c59">my_binary_tree::~my_binary_tree</a></div><div class="ttdeci">~my_binary_tree()</div><div class="ttdoc">析构函数（递归释放内存）</div><div class="ttdef"><b>Definition</b> my_tree.h:173</div></div>
<div class="ttc" id="aclassmy__binary__tree_html_aabf0c965e92e633f4d25f9b88da19a28"><div class="ttname"><a href="classmy__binary__tree.html#aabf0c965e92e633f4d25f9b88da19a28">my_binary_tree::get_nodes_num</a></div><div class="ttdeci">int get_nodes_num()</div><div class="ttdoc">计算二叉树的总节点数</div><div class="ttdef"><b>Definition</b> my_tree.h:568</div></div>
<div class="ttc" id="aclassmy__binary__tree_html_abf00c3450fd579d439c231202d2af556"><div class="ttname"><a href="classmy__binary__tree.html#abf00c3450fd579d439c231202d2af556">my_binary_tree::revolve</a></div><div class="ttdeci">my_binary_tree&lt; T &gt; * revolve(my_binary_tree&lt; T &gt; *node, string mode)</div><div class="ttdoc">旋转二叉树（未实现）</div></div>
<div class="ttc" id="aclassmy__binary__tree_html_ad767eada19d83ada460c5eb0c2104056"><div class="ttname"><a href="classmy__binary__tree.html#ad767eada19d83ada460c5eb0c2104056">my_binary_tree::find_father</a></div><div class="ttdeci">my_binary_tree&lt; T &gt; * find_father(my_binary_tree&lt; T &gt; *son)</div><div class="ttdoc">查找指定节点的父节点</div><div class="ttdef"><b>Definition</b> my_tree.h:635</div></div>
<div class="ttc" id="aclassmy__binary__tree_html_ad8ae3e1b3073a79df62de135e337192a"><div class="ttname"><a href="classmy__binary__tree.html#ad8ae3e1b3073a79df62de135e337192a">my_binary_tree::get_h_layer_nodes</a></div><div class="ttdeci">int get_h_layer_nodes(int h)</div><div class="ttdoc">计算第h层的节点总数</div><div class="ttdef"><b>Definition</b> my_tree.h:528</div></div>
<div class="ttc" id="aclassmy__binary__tree_html_adb685df412bb6481f5167165312868ad"><div class="ttname"><a href="classmy__binary__tree.html#adb685df412bb6481f5167165312868ad">my_binary_tree::is_binary_search_tree</a></div><div class="ttdeci">bool is_binary_search_tree()</div><div class="ttdoc">判断二叉树是否为二叉搜索树（BST）</div><div class="ttdef"><b>Definition</b> my_tree.h:598</div></div>
<div class="ttc" id="aclassmy__binary__tree_html_ae19ca02504d47a17836f0b0c533f8982"><div class="ttname"><a href="classmy__binary__tree.html#ae19ca02504d47a17836f0b0c533f8982">my_binary_tree::my_binary_tree</a></div><div class="ttdeci">my_binary_tree(T val)</div><div class="ttdoc">构造函数（创建单个节点）</div><div class="ttdef"><b>Definition</b> my_tree.h:157</div></div>
<div class="ttc" id="aclassmy__binary__tree_html_ae2d15edcaec6e5543a5e8c64ea0173cb"><div class="ttname"><a href="classmy__binary__tree.html#ae2d15edcaec6e5543a5e8c64ea0173cb">my_binary_tree::data</a></div><div class="ttdeci">T data</div><div class="ttdoc">节点存储的数据</div><div class="ttdef"><b>Definition</b> my_tree.h:146</div></div>
<div class="ttc" id="aclassmy__binary__tree_html_aedeb2af1e014d361fb7c2f1423e9f58d"><div class="ttname"><a href="classmy__binary__tree.html#aedeb2af1e014d361fb7c2f1423e9f58d">my_binary_tree::operator=</a></div><div class="ttdeci">my_binary_tree&lt; T &gt; &amp; operator=(my_binary_tree&lt; T &gt; &amp;other)</div><div class="ttdoc">赋值运算符重载（深拷贝）</div><div class="ttdef"><b>Definition</b> my_tree.h:390</div></div>
<div class="ttc" id="aclassmy__binary__tree_html_aff9c3c138c4fc970016a826ec0653eaf"><div class="ttname"><a href="classmy__binary__tree.html#aff9c3c138c4fc970016a826ec0653eaf">my_binary_tree::print_full_to_vector</a></div><div class="ttdeci">void print_full_to_vector(vector&lt; T &gt; &amp;vv)</div><div class="ttdoc">层序遍历二叉树，将节点值存入向量（不含占位符）</div><div class="ttdef"><b>Definition</b> my_tree.h:1026</div></div>
<div class="ttc" id="aclassmy__complete__binary__tree_html"><div class="ttname"><a href="classmy__complete__binary__tree.html">my_complete_binary_tree</a></div><div class="ttdoc">完全二叉树类（模板类，支持任意数据类型T）</div><div class="ttdef"><b>Definition</b> my_tree.h:1176</div></div>
<div class="ttc" id="aclassmy__full__binary__tree_html"><div class="ttname"><a href="classmy__full__binary__tree.html">my_full_binary_tree</a></div><div class="ttdoc">满二叉树类（模板类，支持任意数据类型T）</div><div class="ttdef"><b>Definition</b> my_tree.h:1201</div></div>
<div class="ttc" id="aclassmy__full__binary__tree_html_abc576874d3f353e19c3e4ef154b6c039"><div class="ttname"><a href="classmy__full__binary__tree.html#abc576874d3f353e19c3e4ef154b6c039">my_full_binary_tree::construct_full_binary_tree</a></div><div class="ttdeci">my_full_binary_tree&lt; T &gt; * construct_full_binary_tree(vector&lt; T &gt; values, int index)</div><div class="ttdoc">层先法构造满二叉树</div><div class="ttdef"><b>Definition</b> my_tree.h:1230</div></div>
</div><!-- fragment --></div><!-- contents -->
</div><!-- doc-content -->
</div><!-- container -->
<!-- start footer part -->
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
  <ul>
    <li class="navelem"><b>my_tree.h</b></li>
    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.14.0 </li>
  </ul>
</div>
</body>
</html>
